By Topic

Low-delay CELP and tree coders: comparison and performance improvements

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

2 Author(s)
M. Foodeei ; Dept. of Electr. Eng., McGill Univ., Montreal, Que., Canada ; P. Kabal

A stochastic tree coder based on the (M,L) search algorithm suggested by V. Iyengar and P. Kabal (1988) and a low-day CELP (code-excited linear prediction) coder proposed by J.H. Chen (1989) are considered. The individual components (predictors, gain adaptation, excitation coding) of the two coders are analyzed. The performances of the two types of coders are compared. The two coders have comparable performance at 16 kb/s under clean channel conditions. Methods to improve the performance of the coders, particularly with a view to bringing the bit rate to below 16 kb/s, are studied. Suggestions for improving the performance include an improved high-order predictor (applicable to both coders), and training of the excitation dictionary as well as a better gain adaptation strategy for the tree coder

Published in:

Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference on

Date of Conference:

14-17 Apr 1991