Abstract

We consider the problem of efficient codebook search for the code excited linear predictive (CELP) speech coders. To dimmish the search complexity a trellis codebook is proposed and decoding algorithms based on the Viterbi algorithm are investigated. Numerical results of the computer simulation are presented.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call