Geometric piecewise uniform lattice vector quantization of the memoryless Gaussian source

DOI10.1016/j.ins.2011.03.012zbMath1252.94036OpenAlexW2020645599MaRDI QIDQ545385

Aleksandra Ž. Jovanović, Zoran H. Perić

Publication date: 22 June 2011

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2011.03.012

zbMATH Keywords

vector quantizationmemoryless Gaussian sourceprobability density function discretization

Mathematics Subject Classification ID

Gaussian processes (60G15) Source coding (94A29)

Related Items (1)

Variable-length coding for performance improvement of asymptotically optimal unrestricted polar quantization of bivariate Gaussian source

Cites Work

• Unnamed Item
• Optimal companding vector quantization for circularly symmetric sources
• Geometric source coding and vector quantization
• Two-dimensional quantization of bivariate circularly symmetric densities
• Companding and random quantization in several dimensions
• Voronoi regions of lattices, second moments of polytopes, and quantization
• Unrestricted multistage vector quantizers
• Lattice and trellis quantization with lattice- and trellis-bounded codebooks-High-rate theory for memoryless sources
• Asymptotically optimal block quantization
• Polar Quantization of a Complex Gaussian Random Variable
• Uniform and piecewise uniform lattice vector quantization for memoryless Gaussian and Laplacian sources
• Analytical coding of Gaussian sources
• Gaussian source coding with spherical codes
• Multidimensional companding quantization of the gaussian source
• Quantization
• Two-stage vector quantization-lattice vector quantization

This page was built for publication: Geometric piecewise uniform lattice vector quantization of the memoryless Gaussian source