Optimal Step-Size Constant Modulus Algorithm

The step size leading to the absolute minimum of the constant modulus (CM) criterion along the search direction can be obtained algebraically at each iteration among the roots of a third-degree polynomial. The resulting optimal step-size CMA (OS-CMA) is compared with, other CM-based iterative techni...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 56; no. 1; pp. 10 - 13
Main Authors: Zarzoso, V., Comon, P.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.01.2008
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algebra
Algorithms
Applied sciences
Blind equalizers
Computer Science
Convergence
Cost function
Criteria
Delay
Detection, estimation, filtering, equalization, prediction
Digital communication
Engineering Sciences
Exact sciences and technology
Information, signal and communications theory
Matrix decomposition
Mean square error methods
Optimization
Polynomials
Recursive estimation
Roots
Searching
Signal and communications theory
Signal and Image Processing
Signal, noise
Stochastic processes
Telecommunications and information theory
Tradeoffs
Performance evaluation
Adaption coefficient
CMA
Algebraic method
SIMO and SISO channels
exact line search
Iterative method
Blind equalization
Constant modulus algorithm
constant modulus
ISSN:0090-6778, 1558-0857
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The step size leading to the absolute minimum of the constant modulus (CM) criterion along the search direction can be obtained algebraically at each iteration among the roots of a third-degree polynomial. The resulting optimal step-size CMA (OS-CMA) is compared with, other CM-based iterative techniques in terms of performance-versus-complexity trade-off.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2008.050484