Low-complexity constrained affine-projection algorithms

Authors:
S. Werner;J.A. Apolinario, Jr.;M.L.R. de Campos;P.S.R. Diniz
Affiliations:
Helsinki Univ. of Technol., Finland;-;-;-
Venue:
IEEE Transactions on Signal Processing
Year:
2005

Citing 0
Cited 4

Set-membership proportionate affine projection algorithms

EURASIP Journal on Audio, Speech, and Music Processing
Efficient multichannel NLMS implementation for acoustic echo cancellation

EURASIP Journal on Audio, Speech, and Music Processing
Steady-state mean-square performance analysis of a relaxed set-membership NLMS algorithm by the energy conservation argument

IEEE Transactions on Signal Processing
A variable step-size affine projection algorithm

Digital Signal Processing

Quantified Score

Hi-index	35.69

Visualization

Abstract

This paper proposes low-complexity constrained affine-projection (CAP) algorithms. The algorithms are suitable for linearly constrained filtering problems often encountered in communications systems. The CAP algorithms derived in this paper trade convergence speed and computational complexity in the same way as the conventional affine-projection (AP) algorithm. In addition, data-selective versions of the CAP algorithm are derived based on the concept of set-membership filtering. The set-membership constrained affine-projection (SM-CAP) algorithms include several constraint sets in order to construct a space of feasible solutions for the coefficient updates. The SM-CAP algorithms include a data-dependent step size that provides fast convergence and low mean-squared error. The paper also discusses important aspects of convergence and stability of constrained normalized adaptation algorithms and shows that normalization may introduce bias in the final solution.