Celp Website Links For
Code 		 

Information About

Celp
  CATEGORIES ABOUT CODE EXCITED LINEAR PREDICTION
   
speech codecs
   
APPAREL
BABY
BEAUTY
BOOKS
CAR TOYS
CELL PHONES
DVD'S
ELECTRONICS
GOURMET FOOD
GROCERIES
HEALTH & PERSONAL
HOME & GARDEN
JEWELRY
MUSIC
MUSIC INSTRUMENTS
OFFICE PRODUCTS
SOFTWARE
SPORTING GOODS
TOOLS & HARDWARE
TOYS
VIDEO GAMES
SHOPPING HOME
MORE SHOPPING...




INTRODUCTION

The CELP algorithm is based on four main ideas:


The original algorithm as proposed by Schroeder and Atal required 100 seconds to encode 1 second of speech when run on a Cray I supercomputer. Since then, more efficient ways of implementing the codebooks and improvements in computing capabilities have made it possible to run the algorithm in embedded devices, such as mobile phones.


CELP DECODER


Before exploring the complex encoding process of CELP we introduce the Speex decoder here. Figure 1 describes a generic CELP decoder. The excitation is produced by summing the contributions from an adaptive (aka pitch) codebook and a fixed (aka innovation) codebook:

:e {Link without Title} =e_{a} {Link without Title} +e_{f} {Link without Title}

where e_{a} is the adaptive ( Pitch ) codebook contribution and e_{f}[n is the fixed (innovation) codebook contribution. The fixed codebook is a Vector Quantization dictionary that is (implicitly or explicitly) hard-coded in to the codec. This codebook can be algebraic ( ACELP ) or be stored explicitly (e.g. Speex ). The entries in the adaptive codebook consist of delayed versions of the excitation. This makes it possible to efficiently code periodic signals, such as voiced sounds.

The filter that shapes the excitation has an all-pole model of the form 1/A(z), where A(z) is called the prediction filter and is obtained using linear prediction ( Levinson-Durbin Algorithm ). An all-pole filter is used because it is a good representation of the human vocal tract and because it is easy to compute.


CELP ENCODER

The main principle behind CELP is called Analysis-by-Synthesis (AbS) and means that the encoding (analysis) is performed by perceptually optimising the decoded (synthesis) signal in a closed loop. In theory, the best CELP stream would be produced by trying all possible bit combinations and selecting the one that produces the best-sounding decoded signal. This is obviously not possible in practice for two reasons: the required complexity is beyond any currently available hardware and the "best sounding" selection criterion implies a human listener.

In order to achieve real-time encoding using limited computing resources, the CELP search is broken down into smaller, more manageable, sequential searches using a simple perceptual weighting function. Typically, the encoding is performed in the following order:
  • LPC coefficients are computed and quantized, usually as LSP s

  • The adaptive (pitch) codebook is searched and its contribution removed

  • The fixed (innovation) codebook is searched



Noise Weighting

Most (if not all) modern audio codecs attempt to Shape The Coding Noise so that it appears mostly in the frequency regions where the ear cannot detect it. For example, the ear is more tolerant to noise in parts of the spectrum that are louder and vice versa. That's why instead of minimizing the simple quadratic error, CELP minimizes the error for the ''perceptually weighted'' domain. The weighting filter W(z) is typically derived from the LPC filter by the use of Bandwidth Expansion :

:W(z) = rac{A(z/\gamma_1)}{A(z/\gamma_2)}

where \gamma_1 > \gamma_2.


EXTERNAL LINKS



REFERENCES

M. R. Schroeder and B. S. Atal, "Code-excited linear prediction (CELP): high-quality speech at very low bit rates," in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), vol. 10, pp. 937-940, 1985.