VLSI Architectures and Implementations for Vector Quantization

Abstract Several architectural strategies for the implementation of vector quantization algorithms are reviewed. These include full search and tree search algorithms. The required processor complexity is analyzed as a function of desired system parameters. The tradeoffs with several implementations reported in the literature are also analyzed. General guidelines for integrated circuit design are presented.

[1]  BERTRAM P. M. TAO,et al.  Hardware Realization of Waveform Vector Quantizers , 1984, IEEE J. Sel. Areas Commun..

[2]  Philip A. Chou,et al.  Optimal pruning with applications to tree-structured source coding and modeling , 1989, IEEE Trans. Inf. Theory.

[3]  R. Gray,et al.  Vector quantization , 1984, IEEE ASSP Magazine.

[4]  Allen Gersho,et al.  Application of a VLSI Vector Quantization Processor to Real-Time Speech Coding , 1986, IEEE J. Sel. Areas Commun..

[5]  Sethuraman Panchanathan,et al.  A systolic array architecture for image coding using adaptive vector quantization , 1991, IEEE Trans. Circuits Syst. Video Technol..

[6]  Peter R. Cappello,et al.  Systolic architectures for vector quantization , 1988, IEEE Trans. Acoust. Speech Signal Process..

[7]  P. A. Ramamoorthy,et al.  Bit-serial VLSI implementation of vector quantizer for real-time image coding , 1989 .

[8]  Gary J. Sullivan,et al.  Recursive optimal pruning of tree-structured vector quantizers , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[9]  J. Smith,et al.  Vector quantizer architectures for speech and image coding , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.