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
Type de document :
Article dans une revue
IEEE Transactions on Communications, Institute of Electrical and Electronics Engineers, 1998, 46 (12), pp.1602-1609. <10.1109/26.737398>
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01322217
Contributeur : Marc Antonini <>
Soumis le : jeudi 26 mai 2016 - 17:34:24
Dernière modification le : mercredi 15 juin 2016 - 09:05:41

Identifiants

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>

Partager

Métriques

Consultations de la notice

53