Convergence properties of affine projection and normalized data reusing methods

• Published in: Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284) Vol. 2; pp. 1166 - 1170 vol.2
• Main Authors: Soni, R.A., Gallivan, K.A., Jenkins, W.K.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 1998
• Subjects: Adaptive filters; Algorithm design and analysis; Convergence; Costs; Data engineering; Filtering algorithms; Least squares approximation; Least squares methods; Noise measurement; Steady-state
• ISBN: 0780351487; 9780780351486
• ISSN: 1058-6393
• DOI: 10.1109/ACSSC.1998.751444

The coloring of input sequences can significantly reduce the effective convergence rate of normalized least mean squares (LMS) adaptive filtering algorithms. There has been significant interest in affine projection adaptive filtering algorithms. These algorithms offer improved performance over traditional normalized LMS algorithms. They can achieve the performance of recursive least squares techniques at a lower computational cost. Unfortunately, these algorithms can greatly amplify measurement noise leading to higher overall misadjustment and poor tracking abilities. In this paper, the new forms of data reusing methods developed by the authors are shown to be able to approximate the convergence performance of the affine projection methods without the large misadjustment. In addition, a comprehensive analysis of the steady-state statistical convergence properties of a broad class of data reusing algorithms are presented.