Finite-state vector quantization for waveform coding
J. Foster, Robert M. Gray, M. Dunham · IEEE Transactions on Information Theory · 1985
A finite-state vector quantizer is a finite-state machine used for data compression: Each successive source vector is encoded into a codeword using a minimum distortion rule, and into a code book, depending on the encoder state. The current state and the selected codeword then determine the next encoder state. A finite-state vector quantizer is capable of making better use of the memory in a source than is an ordinary memoryless vector quantizer of the same dimension or blocklength. Design techniques are introduced for finite-state vector quantizers that combine ad hoc algorithms with an algorithm for the design of memoryless vector quantizers. Finite-state vector quantizers are designed and simulated for Gauss-Markov sources and sampled speech data, and the resulting performance and storage requirements are compared with ordinary memoryless vector quantization.
Cited by 262 works. doi:10.1109/tit.1985.1057035
Authors
References
- Introduction to automata theory, languages and computation
- Introduction to automata theory, languages, and computation
- An Algorithm for Vector Quantizer Design
- Vector Quantization
- On the Application of Vector Quantization and Hidden Markov Models to Speaker-Independent, Isolated Word Recognition
- Block Quantization of Correlated Gaussian Random Variables
- 25 Continuous speech recognition: Statistical methods
- Vector quantization and Markov source models applied to speech recognition
- Vector quantization of speech and speech-like waveforms
- Finite-state vector quantization for waveform coding