A Fast ACELP Codebook Search Method Based on Pulse Replacement and Tree Pruning

Abstract

The algebraic code excited linear prediction (ACELP) algorithm has been adopted by many speech coding standards, due to low complexity and high quality in its analysis-by-synthesis optimization. One of the optimum ACELP codebook search methods is depth first tree search. Two methods based on pulse replacement and pruning of tree are already proposed for… (More)

Topics

Cite this paper

@inproceedings{Soleimani2009AFA, title={A Fast ACELP Codebook Search Method Based on Pulse Replacement and Tree Pruning}, author={Mojtaba Soleimani and Abolfazl Falahati}, year={2009} }