By Topic

Simplified fast least-squares algorithms for speech predictors

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 $33
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)
C. C. Evci ; TRT, Paris, France ; M. G. Bellanger

The letter deals with the development of a simplified fast least-squares algorithm which is free of roundoff error accumulation. The simplified algorithm requires 9N MADPR (multiplications and divisions per recursion) rather than 10N MADPR as in the fast least squares or fast Kalman (FLS) case where N is the order of predictor. The superiority of SFLS over FLS and LMS approaches is illustrated by prediction gain performance curves for various speech signals.<>

Published in:

Electronics Letters  (Volume:24 ,  Issue: 10 )