DocumentCode :
908660
Title :
Algebraic vector quantization of LSF parameters with low storage and computational complexity
Author :
Xie, Minjie ; Adoul, Jean-Pierre
Author_Institution :
Dept. of Electr. & Comput. Eng., Sherbrooke Univ., Que., Canada
Volume :
4
Issue :
3
fYear :
1996
fDate :
5/1/1996 12:00:00 AM
Firstpage :
234
Lastpage :
239
Abstract :
This correspondence presents an algebraic vector-quantization scheme for encoding line spectral frequency (LSF) parameters used in linear predictive coding (LPC) of speech. The scheme is based on low-dimensionality regular-point lattices. The algebraic codebook need not be stored, and the optimum codevector is found through simple rounding of the input vector. Thus, the scheme results in significant savings of memory and reduced computational complexity when compared to traditional vector-quantizer solutions. The quantizer achieves an average spectral distortion of about 1 dB at 28 b/frame for the telephone bandwidth
Keywords :
computational complexity; linear predictive coding; speech coding; vector quantisation; LPC; LSF parameters; algebraic codebook; algebraic vector quantization; average spectral distortion; computational complexity; line spectral frequency parameters; linear predictive coding; low-dimensionality regular-point lattices; optimum codevector; speech coding; telephone bandwidth; Computational complexity; Filters; Frequency; Hidden Markov models; Linear predictive coding; Parameter estimation; Signal processing algorithms; Speech coding; Speech recognition; Vector quantization;
fLanguage :
English
Journal_Title :
Speech and Audio Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1063-6676
Type :
jour
DOI :
10.1109/89.496220
Filename :
496220
Link To Document :
بازگشت