An affine projection algorithm with variable step size and projection order

It is known that the performance of adaptive algorithms is constrained by their computational cost. Thus, affine projection adaptive algorithms achieve higher convergence speed when the projection order increases, which is at the expense of a higher computational cost. However, regardless of computa...

Full description

Saved in:
Bibliographic Details
Published in:Digital signal processing 2012-07, Vol.22 (4), p.586-592
Main Authors: Gonzalez, Alberto, Ferrer, Miguel, de Diego, Maria, Piñero, Gema
Format: Article
Language:English
Subjects:
Adaptive algorithms
Adaptive filter
Affine projection algorithm
Algorithms
Computational cost
Computational efficiency
Convergence
Cost engineering
Expenses
Projection
Steady state
Variable step size
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:It is known that the performance of adaptive algorithms is constrained by their computational cost. Thus, affine projection adaptive algorithms achieve higher convergence speed when the projection order increases, which is at the expense of a higher computational cost. However, regardless of computational cost, a high projection order also leads to higher final error at steady state. For this reason it seems advisable to reduce the computational cost of the algorithm when high convergence speed is not needed (steady state) and to maintain or increase this cost only when the algorithm is in transient state to encourage rapid transit to the permanent regime. The adaptive order affine projection algorithm presented here addresses this subject. This algorithm adapts its projection order and step size depending on its convergence state by simple and meaningful rules. Thus it achieves good convergence behavior at every convergence state and very low computational cost at steady state.
ISSN:1051-2004
1095-4333
DOI:10.1016/j.dsp.2012.03.004