A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Quantizing Using Lattice Intersections
[chapter]

2003
*
Algorithms and Combinatorics
*

The usual quantizer based on an n-dimensional lattice Λ maps a point x ∈ n to a closest lattice point. Suppose Λ is the intersection of lattices Λ 1 , . . . , Λ r . Then one may instead combine the information obtained by simultaneously quantizing x with respect to each of the Λ i . This corresponds to decomposing n into a honeycomb of cells which are the intersections of the Voronoi cells for the Λ i , and identifying the cell to which x belongs. This paper shows how to write several standard

doi:10.1007/978-3-642-55566-4_38
fatcat:jxnbsmx3hncefemfkb4uyjbyra