The goal of this correspondence is to propose a low-complexity enumeration algorithm for lattice vectors, based on a geometrical interpretation and valid for different source distributions, i.e., for different L/sub p/-norms in the range 0

Code vector indexing is a key problem in lattice quantization applications. In order to solve this problem, we propose a method based on the idea of a coding table encompassing a set of points as small as possible. Our method works for both spherical and pyramidal code books. It provides a good tradeoff between computational complexity and storage requirements.

Indexing the codevectors is a key problem in lattice quantization applications. We propose a method based on the idea of a coding table encompassing a set of points chosen as small as possible and called the fundamental region. Our method works for both spherical and pyramidal codebooks. It provides a good tradeoff between computational complexity and storage requirements. Finally, it improves of 3 dB on the signal-to-noise ratio of the LBG algorithm at a given memory cost.