Name
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 |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1109/ICASSP.1992.225974 | Acoustics, Speech, and Signal Processing, 1992. ICASSP-92., 1992 IEEE International Conference |
Keywords | DocType | Volume |
celp coder,linear predictive coding,reduced complexity celp coder,vocoder,subset s1,subsampling,celp vocoder,codebook,synthetic signal energy,vocoders,computational complexity,basic idea,bit rate,computation task,speech coding,calculation gain,multistage method,code excited linear prediction,candidate codewords,reduced complexity,full exact search,frequency range,speech synthesis,frequency,sorting,acoustic noise | Conference | 1 |
ISSN | Citations | PageRank |
1520-6149 | 0 | 0.34 |
References | Authors | |
4 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Mauc | 1 | 0 | 0.68 |
| Geneviève Baudoin | 2 | 138 | 19.08 |