Fast methods for the CELP speech coding algorithm

Special fast procedures for the code excited linear predictive coding (CELP) algorithm have been developed to make implementation on modest hardware possible. The advantages, as well as the disadvantages, of the various fast procedures are discussed. A general formalism for the algorithm is developed, followed by the discussion of the individual procedures which are grouped according to their features. Along with the computational complexity of each procedure, its storage requirement and numerical accuracy are discussed. A large number of the fast procedures are designed to search through a particular type of codebook (most of the codebooks are stochastic in character, while a few are deterministic). Other fast procedures can be used for arbitrary codebooks and are thus also applicable to trained codebooks. Some of the fast procedures designed for stochastic codebooks can also be used for the computation of the closed pitch loop parameters, which can be interpreted as a search through a time-dependent codebook