Using geometrical properties for fast indexation of Gaussian vector quantizers

DOI10.1155/2007/63192MaRDI QIDQ838753zbMATH OpenOpenAlexWikidataFDO

Authors Ekaterina A. Vassilieva, Daniel Krob, Jean-Marc Steyaert

Publication date 1 September 2009

Published in EURASIP Journal on Advances in Signal Processing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2007/63192

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Communication theory (94A05) Channel models (including quantum) in information and communication theory (94A40) Modulation and demodulation in information and communication theory (94A14)

Recommendations

• scientific article; zbMATH DE number 3946030
• On channel-constrained vector quantization and index assignment for discrete memoryless channels
• Low-complexity indexing method for \(Z^n\) and \(D_n\) lattice quantizers
• Optimal binary index assignments for a class of equiprobable scalar and vector quantizers
• scientific article; zbMATH DE number 467196

Cites work

• Robust vector quantization by a linear mapping of a block code
• The Hadamard transform-a tool for index assignment

Cited in

(2)

• Low-complexity indexing method for \(Z^n\) and \(D_n\) lattice quantizers
• scientific article; zbMATH DE number 3946030 (Why is no real title available?)

This page was built for publication: Using geometrical properties for fast indexation of Gaussian vector quantizers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q838753)