On the performance and complexity of channel-optimized vector quantizers

DOI10.1109/18.61130MaRDI QIDQ3197748zbMATH OpenOpenAlexFDO

Authors Nariman Farvardin, Vinay Vaishampayan

Publication date 1991

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1903/4863

zbMATH Keywords

source codingencoding complexitychannel-optimized vector quantizersEuclidean distance measurementGauss-Markov sourcesquared-error distortion measurevery noisy channels

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Vector Quantization by Companding a Union of Z-Lattices
• Complexity-constrained tree-structured vector quantizers
• On channel-constrained vector quantization and index assignment for discrete memoryless channels
• Soft decoding for vector quantization over noisy channels with memory
• Complexity-constrained trellis quantizers

Cited in

(8)

• The source-channel separation theorem revisited
• Lossless coding of multichannel signals using optimal vector hierarchical decomposition
• Computation of the complexity of vector quantizers by affine modeling
• Performance Re-Evaluation on “Codewords Distribution-Based Optimal Combination of Equal-Average Equal-Variance Equal-Norm Nearest Neighbor Fast Search Algorithm for Vector Quantization Encoding”
• Channel-matched hierarchical table-lookup vector quantization
• Quantizers with uniform decoders and channel-optimized encoders
• A Bayesian Analysis of Self-Organizing Maps
• Memory efficient adaptation of vector quantizers to time-varying channels

This page was built for publication: On the performance and complexity of channel-optimized vector quantizers

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