On reducing computational complexity of codebook search in CELP coding
J.I. Lee, C.K. Un · IEEE Transactions on Communications · 1990
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.>