DocumentCode :
1928587
Title :
A new MMSE encoding algorithm for vector quantization
Author :
Joshi, R.L. ; Poonacha, P.G.
Author_Institution :
Dept. of Electr. Eng., Indian Inst. of Technol., Bombay, India
fYear :
1991
fDate :
14-17 Apr 1991
Firstpage :
645
Abstract :
An algebraic interpretation of characterization of a quantizer point in terms of its neighbors is presented, along with a new method for finding the neighbors. A novel MMSE (minimum mean squared error) encoding algorithm for vector quantization is proposed. The use of a prequantizer for providing a good starting point to the new algorithm is discussed. Simulation results show that the new algorithm, used in conjunction with Gersho´s (1982) method for finding the neighbors, effects a substantial decrease in the total number of operations required for encoding when compared with the fast algorithm proposed by Soleymani and Morgera (1988). The drawback of the new algorithm is the increased storage requirement
Keywords :
data compression; encoding; MMSE encoding algorithm; minimum mean squared error; neighbors; prequantizer; simulation results; vector quantization; Argon; Bit rate; Computational complexity; Encoding; Samarium; Vector quantization;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference on
Conference_Location :
Toronto, Ont.
ISSN :
1520-6149
Print_ISBN :
0-7803-0003-3
Type :
conf
DOI :
10.1109/ICASSP.1991.150422
Filename :
150422
Link To Document :
بازگشت