Close category search window
 

Fast sequential algorithms for least squares FIR filters with linear phase

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
$31 $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)
Kalouptsidis, N. ; Dept. of Phys., Athens Univ., Greece ; Theodoridis, S.

Two algorithms are presented that adaptively compute the coefficients of a finite-input response (FIR) transversal filter with linear (affine) phase. The first algorithm is of the least-squares covariance type with a computational complexity of 18.5 m MADS (multiplications and additions), m being the order of the filter. The second one corresponds to the sliding-memory case and requires 24 m MADS. The prewindowed algorithm, a special case of the covariance type algorithm is also discussed and requires 10.5 m MADS. The algorithms are derived for the general multichannel case. The task of initialization is also considered

Published in:
Circuits and Systems, IEEE Transactions on  (Volume:35 ,  Issue: 4 )

Date of Publication: Apr 1988

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.