By Topic

A Globally Convergent Stochastic Pairwise Conjugate Gradient-Based Algorithm for Adaptive Filtering

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

1 Author(s)
Ahmad, N.A. ; Sch. of Math. Sci., Univ. Sains Malaysia, Nibong Tebal

It is well known that, for the deterministic optimization problem, the method of conjugate gradient has superior convergence rates compared to ordinary gradient methods. For quadratic problems, the conjugate gradient method has finite termination property which makes it one of the most favorable iterative methods. However, the fast convergence and the finite termination property can easily break down when the function to be optimized is noisy since conjugacy among search directions can no longer be maintained over the course of the iterations. In this letter, a conjugation procedure is applied in an adaptive filtering algorithm, where, instead of producing a set of conjugate search directions, only pairwise conjugation of gradients is produced during each system update. Simulations show that the algorithm provides superior convergence compared to the stochastic gradient descent algorithm, and comparable to existing conjugate gradient-based adaptive filtering algorithms, but at a lower computational cost.

Published in:

Signal Processing Letters, IEEE  (Volume:15 )