Title :
On reducing computational complexity of codebook search in CELP coding
Author :
Lee, J.I. ; Un, C.K.
Author_Institution :
Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol., Seoul, South Korea
fDate :
11/1/1990 12:00:00 AM
Abstract :
A computationally efficient codebook search method in code-excited linear prediction is proposed. The method can reduce the computational complexity by almost one half compared to the frequency-domain codebook search method that is currently regarded as the fastest search method, while giving almost the same quality of speech. This reduction is possible as a result of the simultaneous use of frequency-domain search and code vector sparsity
Keywords :
computational complexity; encoding; filtering and prediction theory; speech analysis and processing; CELP coding; code vector sparsity; code-excited linear prediction; codebook search; computational complexity; frequency-domain search; synthetic speech; Adaptive filters; Bit rate; Books; Computational complexity; Helium; Nonlinear filters; Search methods; Speech processing; Technological innovation; Vectors;
Journal_Title :
Communications, IEEE Transactions on
