A generalized data windowing scheme for adaptive conjugate gradient algorithms

  • Authors:
  • Shengkui Zhao;Zhihong Man;Suiyang Khoo

  • Affiliations:
  • School of Computer Engineering, Nanyang Technological University (NTU), Nanyang Avenue, Singapore 639798, Singapore;School of Engineering, Monash University (Malaysia), Jalan Lagoon Selatan, Bandar Sunway, Petaling Jaya 46150, Malaysia;School of Engineering, Monash University (Malaysia), Jalan Lagoon Selatan, Bandar Sunway, Petaling Jaya 46150, Malaysia

  • Venue:
  • Signal Processing
  • Year:
  • 2009

Quantified Score

Hi-index 0.08

Visualization

Abstract

The performance of the modified adaptive conjugate gradient (CG) algorithms based on the iterative CG method for adaptive filtering is highly related to the ways of estimating the correlation matrix and the cross-correlation vector. The existing approaches of implementing the CG algorithms using the data windows of exponential form or sliding form result in either loss of convergence or increase in misadjustment. This paper presents and analyzes a new approach to the implementation of the CG algorithms for adaptive filtering by using a generalized data windowing scheme. For the new modified CG algorithms, we show that the convergence speed is accelerated, the misadjustment and tracking capability comparable to those of the recursive least squares (RLS) algorithm are achieved. Computer simulations demonstrated in the framework of linear system modeling problem show the improvements of the new modifications.