By Topic

Fixed-window constant modulus algorithms: adaptive implementations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xiang-Yang Zhuang ; Dept. of Electr. & Comput. Eng., Brigham Young Univ., Provo, UT, USA ; A. L. Swindlehurst

Adaptive implementations of two previously proposed block-iterative algorithms; referred to as fixed-window constant modulus algorithms (FWCMA), are developed. Their transient behavior, in relation to the delay at which the user sequence is recovered, is discussed and compared with other existing variations of CMA. The adaptive FWCMA-2 appears to be particularly promising, attaining convergence with little data. It retains the merits of its batch counterpart, namely, fast convergence, robustness to ill-conditioning, no required step-size tuning, and relatively low complexity. The built-in control over the converged delay translates into more reliable and predictable transient behavior. Equalizer calculation can be initiated from any initialization, and at any time instant, to attain convergence instantaneously without storing any received data. Thus, different initializations can be used to easily obtain multiple equalizers recovering the signal at different delays or recovering distinct users under a near-far simulation

Published in:

Signal Processing Advances in Wireless Communications, 1999. SPAWC '99. 1999 2nd IEEE Workshop on

Date of Conference: