Optimum quantizer performance for a class of non-Gaussian memoryless sources

DOI10.1109/TIT.1984.1056920MaRDI QIDQ3329365zbMATH OpenWikidataFDO

Authors Nariman Farvardin, James W. Modestino

Publication date 1984

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

Full work available at URL https://doi.org/10.1109/TIT.1984.1056920

zbMATH Keywords

entropy encoded uniform quantizationmemoryless sourcesperformance of optimum quantizersrate-distortion boundrecursive algorithmworst case performance

Mathematics Subject Classification ID

Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Recommendations

• Optimal entropy-constrained scalar quantization of a uniform source
• On optimal quantization of noisy sources
• On the cost of finite block length in quantizing unbounded memoryless sources
• Source coding bounds using quantizer reproduction levels (Corresp.)
• Low-resolution scalar quantization for Gaussian sources and squared error

Cited in

(15)

• Optimal entropy-constrained scalar quantization of a uniform source
• On optimal quantization of noisy sources
• Source coding bounds using quantizer reproduction levels (Corresp.)
• Low-resolution scalar quantization for Gaussian sources and squared error
• Quantization of Multiple Sources Using Nonnegative Integer Bit Allocation
• Low-Resolution Scalar Quantization for Gaussian Sources and Absolute Error
• Decision-Theoretic Saliency: Computational Principles, Biological Plausibility, and Implications for Neurophysiology and Psychophysics
• Quantizer Mismatch
• Rate-distortion bound for a class of non-Gaussian sources with memory
• Optimal Discrete Gaussian Function: The Closed-Form Functions Satisfying Tao’s and Donoho’s Uncertainty Principle With Nyquist Bandwidth
• scientific article; zbMATH DE number 6174028 (Why is no real title available?)
• Variable-length coding for performance improvement of asymptotically optimal unrestricted polar quantization of bivariate Gaussian source
• Geometric piecewise uniform lattice vector quantization of the memoryless Gaussian source
• Bayesian learning of finite generalized Gaussian mixture models on images
• Memory efficient adaptation of vector quantizers to time-varying channels

This page was built for publication: Optimum quantizer performance for a class of non-Gaussian memoryless sources

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