Adaptive signal processing
Fast projection algorithm and its step size control
ICASSP '95 Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02
A stable fast affine projection adaptation algorithm suitable for low-cost processors
ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01
Fast exact affine projection algorithm using displacement structure theory
DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
A variable step-size affine projection algorithm
Digital Signal Processing
EURASIP Journal on Advances in Signal Processing
Convergence behavior of affine projection algorithms
IEEE Transactions on Signal Processing
Transient and steady-state analysis of filtered-x affine projection algorithms
IEEE Transactions on Signal Processing
A Variable Step-Size Affine Projection Algorithm Designed for Acoustic Echo Cancellation
IEEE Transactions on Audio, Speech, and Language Processing
Hi-index | 0.08 |
Variable order affine projection algorithms have been recently presented to be used when not only the convergence speed of the algorithm has to be adjusted but also its computational cost and its final residual error. These kind of affine projection (AP) algorithms improve the standard AP algorithm performance at steady state by reducing the residual mean square error. Furthermore these algorithms optimize computational cost by dynamically adjusting their projection order to convergence speed requirements. The main cost of the standard AP algorithm is due to the matrix inversion that appears in the coefficient update equation. Most efforts to decrease the computational cost of these algorithms have focused on the optimization of this matrix inversion. This paper deals with optimization of the computational cost of variable order AP algorithms by recursive calculation of the inverse signal matrix. Thus, a fast exact variable order AP algorithm is proposed. Exact iterative expressions to calculate the inverse matrix when the algorithm projection order either increases or decreases are incorporated into a variable order AP algorithm leading to a reduced complexity implementation. The simulation results show the proposed algorithm performs similarly to the variable order AP algorithms and it has a lower computational complexity.