IEEE Transactions on Information Theory
Exponentiated gradient versus gradient descent for linear predictors
Information and Computation
Blind equalization with a deterministic constant modulus cost-a set-membership filtering approach
ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05
Advances in Network and Acoustic Echo Cancellation
Advances in Network and Acoustic Echo Cancellation
Set-membership binormalized data-reusing LMS algorithms
IEEE Transactions on Signal Processing
Low-complexity constrained affine-projection algorithms
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Exploiting sparsity in adaptive filters
IEEE Transactions on Signal Processing
BEACON: an adaptive set-membership filtering technique with sparseupdates
IEEE Transactions on Signal Processing
Partial-update NLMS algorithms with data-selective updating
IEEE Transactions on Signal Processing
A family of adaptive filter algorithms with decorrelatingproperties
IEEE Transactions on Signal Processing
Proportionate adaptive algorithms for network echo cancellation
IEEE Transactions on Signal Processing
Multiweight optimization in optimal bounding ellipsoid algorithms
IEEE Transactions on Signal Processing
Generalized wideband cyclic MUSIC
EURASIP Journal on Advances in Signal Processing
Affine projection algorithm with selective projections
Signal Processing
Modified quasi-OBE algorithm with improved numerical properties
Signal Processing
Hi-index | 0.00 |
Proportionate adaptive filters can improve the convergence speed for the identification of sparse systems as compared to their conventional counterparts. In this paper, the idea of proportionate adaptation is combined with the framework of set-membership filtering (SMF) in an attempt to derive novel computationally efficient algorithms. The resulting algorithms attain an attractive faster converge for both situations of sparse and dispersive channels while decreasing the average computational complexity due to the data discerning feature of the SMF approach. In addition, we propose a rule that allows us to automatically adjust the number of past data pairs employed in the update. This leads to a set-membership proportionate affine projection algorithm (SM-PAPA) having a variable data-reuse factor allowing a significant reduction in the overall complexity when compared with a fixed data-reuse factor. Reduced-complexity implementations of the proposed algorithms are also considered that reduce the dimensions of the matrix inversions involved in the update. Simulations show good results in terms of reduced number of updates, speed of convergence, and final mean-squared error.