Low complexity indexing method for $Z^n$ and $D_n$ lattice quantizers

Abstract : 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
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01322217
Contributor : Marc Antonini <>
Submitted on : Thursday, May 26, 2016 - 5:34:24 PM
Last modification on : Monday, November 5, 2018 - 3:52:02 PM

Identifiers

Collections

Citation

Jean-Marie Moureaux, Pierre Loyer, Marc Antonini. Low complexity indexing method for $Z^n$ and $D_n$ lattice quantizers. IEEE Transactions on Communications, Institute of Electrical and Electronics Engineers, 1998, 46 (12), pp.1602-1609. ⟨10.1109/26.737398⟩. ⟨hal-01322217⟩

Share

Metrics

Record views

101