DocumentCode :
284687
Title :
Reduced complexity CELP coder
Author :
Mauc, M. ; Baudoin, G.
Author_Institution :
ESIEE Dept. Signaux et Telecommun., Noisy le Grand, France
Volume :
1
fYear :
1992
fDate :
23-26 Mar 1992
Firstpage :
53
Abstract :
Code excited linear predictor (CELP) coders enable speech coding with good quality at bit rates as low as 4 kbps. Several methods have been developed to lessen the computational task. The authors present a multistage method that preserves the qualities of the CELP vocoder with reduced complexity. The basic idea is to find a subset S1 of candidate codewords by approximating the synthetic signal energy. This approximation is obtained by restricting the frequency range and subsampling. A full exact search is done on this subset. The procedure can be iterated. Typically, for an initial codebook of 1024 words and a single stage of subsampling by a factor equal to q 1=5, the size of the subset S1 is 70 and the calculation gain is 9. This performance can be improved up to a calculation gain of 13 by introducing several stages of subsampling q1=5 and q2=2
Keywords :
computational complexity; linear predictive coding; speech coding; vocoders; CELP coder; code excited linear prediction; codebook; multistage method; reduced complexity; speech coding; subsampling; synthetic signal energy; vocoder; Acoustic noise; Bit rate; Frequency; Linear predictive coding; Nonlinear filters; Sorting; Speech analysis; Speech coding; Speech synthesis; Vocoders;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Acoustics, Speech, and Signal Processing, 1992. ICASSP-92., 1992 IEEE International Conference on
Conference_Location :
San Francisco, CA
ISSN :
1520-6149
Print_ISBN :
0-7803-0532-9
Type :
conf
DOI :
10.1109/ICASSP.1992.225974
Filename :
225974
Link To Document :
بازگشت