By Topic

Complexity reduction of CELP coders

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Galand, C. ; IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA ; Menez, J. ; Rosso, M.

The authors propose a modification of the classical CELP (code-excited linear predictive) algorithm in order to reduce its computational complexity and required memory size, while preserving the quality of the reconstructed speech. Rather than performing the individual weighting of each candidate sequence, the authors suggest a global implementation of the vocal tract weighting function at the code-book level, thanks to the use of an adaptive code-book. As a result, the analysis-by-synthesis procedure does not require the processing of all the candidate sequences through the synthesis and weighting filters, and therefore the complexity requirement of the algorithm is much reduced. The method was demonstrated on a 7.2 kb/s adaptive code-book CELP operating with the same level of quality as the 13 kb/s GSM coder which has been normalized for speech coding in the European cellular radio network. The proposed technique was then applied to the design of a coder operating with a low delay requirement

Published in:

Telecommunications Symposium, 1990. ITS '90 Symposium Record., SBT/IEEE International

Date of Conference:

3-6 Sep 1990