Design and analysis of a successively refinable lattice quantizer for i.i.d. Gaussian sources
IEEE Transactions on Signal Processing
On concentric spherical codes and permutation codes with multiple initial codewords
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Spherical logarithmic quantization
IEEE Transactions on Audio, Speech, and Language Processing
On the statistics of matching pursuit angles
Signal Processing
Concentric permutation source codes
IEEE Transactions on Communications
Geometric piecewise uniform lattice vector quantization of the memoryless Gaussian source
Information Sciences: an International Journal
IWDW'05 Proceedings of the 4th international conference on Digital Watermarking
On the achievable rate of side informed embedding techniques with steganographic constraints
IWDW'05 Proceedings of the 4th international conference on Digital Watermarking
The general design of asymptotic unrestricted polar quantizers with square cells
Digital Signal Processing
| Hi-index | 754.84 |
A fixed-rate shape-gain quantizer for the memoryless Gaussian source is proposed. The shape quantizer is constructed from wrapped spherical codes that map a sphere packing in ℝk-1 onto a sphere in ℝk, and the gain codebook is a globally optimal scalar quantizer. A wrapped Leech lattice shape quantizer is used to demonstrate a signal-to-quantization-noise ratio within 1 dB of the distortion-rate function for rates above 1 bit per sample, and an improvement over existing techniques of similar complexity. An asymptotic analysis of the tradeoff between gain quantization and shape quantization is also given