Close category search window
 

A second-order recursive algorithm with applications to adaptive filtering and subspace tracking

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)
Andersson, A. ; Ericsson Micorwave Syst., Molndal, Sweden ; Broman, H.

A second-order recursive algorithm for adaptive signal processing is proposed, and a similar algorithm is derived for signal subspace tracking. It is shown that the algorithm encompasses both the RLS and the LMS algorithms as special cases. The computational complexity is the same as for the RLS algorithm, but some extra memory storage is required. The associated ordinary differential equation (ODE) for the autoregressive exogenous (ARX) case algorithm is proven to be globally exponentially stable. Furthermore, it is demonstrated that the proposed algorithm has a higher ability to track time-varying signals than has the RLS algorithm. The proposed algorithm especially handles well those situations where there is a simultaneous system change and a decrease of signal power

Published in:
Signal Processing, IEEE Transactions on  (Volume:46 ,  Issue: 6 )

Date of Publication: Jun 1998

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.