Algebraic code-excited linear prediction

The main advantage of ACELP is that the algebraic codebook it uses can be made very large (> 50 bits) without running into storage (RAM/ROM) or complexity (CPU time) problems. ==Technology==

The ACELP algorithm is based on that used in code-excited linear prediction (CELP), but ACELP codebooks have a specific algebraic structure imposed upon them. A 16-bit algebraic codebook shall be used in the innovative codebook search, the aim of which is to find the best innovation and gain parameters. The innovation vector contains, at most, four non-zero pulses. In ACELP, a block of N speech samples is synthesized by filtering an appropriate innovation sequence from a codebook, scaled by a gain factor g c, through two time-varying filters. The long-term (pitch) synthesis filter is given by: :\frac1{B(z)} = \frac1{ 1 - g_p z^{-T} } The short-term synthesis filter is given by: :\frac1{A(z)} = \frac1{ 1 + \sum_{i=1}^P a_i z^{-i} } ==References==