A fast algebraic codebook search method
Zhe Song · Journal of Chongqing University of Posts and Telecommunications · 2010
The algebraic-code-excited linear prediction(ACELP)coding algorithm has been widely adopted in various standardized speech coders.In ACELP coders,the global optimization of codevectors requires a huge amount of computational load which brings the bottleneck in real-time implementation on hardware systems.For reducing the computational complexity,a fast codebook search method based on pulse pre-selection and replacement procedure was proposed in this paper.With possible pulse combinations reduced first by using a pulse position prediction technique,the two-level searching strategy and judging mechanism were then employed to enhance the search efficiency in pulse replacing.The experimental results show that the proposed method maintains acceptable speech quality with complexity considerably reduced.