Pseudo-Gray coding
K. Zeger, A. Gersho · IEEE Transactions on Communications · 1990
A pseudo-Gray code is an assignment of n-bit binary indexes to 2" points in a Euclidean space so that the Hamming distance between two points corresponds closely to the Euclidean distance. Pseudo-Gray coding provides a redundancy-free error protection scheme for vector quantization (VQ) of analog signals when the binary indexes are used as channel symbols on a discrete memoryless channel and the points are signal codevectors. Binary indexes are assigned to codevectors in a way that reduces the average quantization distortion introduced in the reproduced source vectors when a transmitted index is corrupted by channel noise. A globally optimal solution to this problem is generally intractable due to an inherently large computational complexity. A locally optimal solution, the binary switching algorithm, is introduced, based on the objective of minimizing a useful upper bound on the average system distortion. The algorithm yields a significant reduction in average distortion, and converges in reasonable running times. The sue of pseudo-Gray coding is motivated by the increasing need for low-bit-rate VQ-based encoding systems that operate on noisy channels, such as in mobile radio speech communications.>
Cited by 379 works. doi:10.1109/26.64657
Authors
References
- The Art of Computer Programming
- An Algorithm for Vector Quantizer Design
- Vector quantization: A pattern-matching technique for speech coding
- A study of vector quantization for noisy channels
- Optimal quantizer design for noisy channels: An approach to combined source - channel coding
- Quantizing for Noisy Channels
- Combined Source-Channel Coding of Images Using the Block Cosine Transform
- Combined Source-Channel Coding of Images
- Reconstruction error in waveform transmission (Corresp.)
- A sub-band coder designed for combined source and channel coding (speech coding)