Paper
13 March 2013 A set-membership approach to blind channel equalization algorithm
Author Affiliations +
Abstract
The constant modulus algorithm (CMA) has low computational complexity while presenting slow convergence and possible convergence to local minima, the CMA family of algorithms based on affine projection version (AP-CMA) alleviates the speed limitations of the CMA. However, the computational complexity has been a weak point in the implementation of AP-CMA. To reduce the computational complexity of the adaptive filtering algorithm, a new AP-CMA algorithm based on set membership (SM-AP-CMA) is proposed. The new algorithm combines a bounded error specification on the adaptive filter with the concept of data-reusing. Simulations confirmed that the convergence rate of the proposed algorithm is significantly faster; meanwhile, the excess mean square error can be maintained in a relatively low level and a substantial reduction in the number of updates when compared with its conventional counterpart.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yue-ming Li "A set-membership approach to blind channel equalization algorithm", Proc. SPIE 8784, Fifth International Conference on Machine Vision (ICMV 2012): Algorithms, Pattern Recognition, and Basic Technologies, 87841W (13 March 2013); https://doi.org/10.1117/12.2014201
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Digital filtering

Computer simulations

Detection and tracking algorithms

Algorithm development

Chemical elements

Single mode fibers

Curium

RELATED CONTENT

Recursive least-squares-based subspace tracking
Proceedings of SPIE (October 28 1994)
Non-Euclidean pyramids
Proceedings of SPIE (December 04 2000)
Simultaneous subspace tracking and rank estimation
Proceedings of SPIE (June 07 1995)
A tutorial on optimization techniques applied to DSM algorithms
Proceedings of SPIE (September 10 2007)
Fast stochastic global optimization
Proceedings of SPIE (October 29 1993)

Back to Top