A high performance blind adaptive filtering algorithm

Authors:
Jusak Jusak;Zahir M. Hussain;Richard Harris
Affiliations:
Centre for Advance Technology in Telecommunications, School of Electrical and Computer Engineering, RMIT University, Melbourne, Victoria, Australia;Centre for Advance Technology in Telecommunications, School of Electrical and Computer Engineering, RMIT University, Melbourne, Victoria, Australia;Centre for Advance Technology in Telecommunications, School of Electrical and Computer Engineering, RMIT University, Melbourne, Victoria, Australia
Venue:
ICECS'03 Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing
Year:
2003

Citing 3
Cited 0

Digital communications: fundamentals and applications

Digital communications: fundamentals and applications
Adaptive filter theory (2nd ed.)

Adaptive filter theory (2nd ed.)
Dithered signed-error CMA: robust, computationally efficient blindadaptive equalization

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently a dithered signed-error constant modulus algorithm (DSE-CMA) has been proposed for the purpose of low complexity implementation of constant modulus algorithm (CMA), which is widely used for blind adaptive filtering due to its LMS-like desirable robustness properties. Despite the fact that this algorithm has robustness properties closely resembling those of CMA, it is very slow in convergence. In this work, we present a simple modification of DSE-CMA using a variable step size that results in faster convergence while preserves the low computational complexity and robustness properties of the DSE-CMA algorithm.