Low-complexity indexing method for Z/sup n/ and D/sub n/ lattice quantizers
Jean-Marie Moureaux, Pierre Loyer, Marc Antonini · IEEE Transactions on Communications · 1998
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.