On Reducing Computational Complexity of Codebook Search in CELP Coding

Abstract

In this paper, we propose a computationally efficient code-book search method in code-excited linear prediction. The proposed method can reduce the computational complexity by almost one half as compared to the frequency-domain codebook search method that is currently regarded as the fastest search method. This reduction is possible as a result of the simultaneous use of frequency-domain search and code vector sparsity.