Cart (Loading....) | Create Account
Close category search window

A batch processing constant modulus algorithm

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
$31 $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)
Changjiang Xu ; Dept. of Electr. & Comput. Eng., Univ. of Florida, Gainesville, FL, USA ; Jian Li

We present a batch processing constant modulus algorithm (BP-CMA) derived by a nonlinear optimization approach to minimizing the constant modulus (CM) criterion. BP-CMA is a line search iteration algorithm. The search direction may be taken as deepest descent direction or Newton direction. The exact step size is obtained from the roots of a cubic equation. The initial value is calculated by using the eigenvectors of the signal subspace. The BP-CMA with the Newton direction has a fast convergence rate and can converge to the minima of the CM criterion after a few iterations.

Published in:

Communications Letters, IEEE  (Volume:8 ,  Issue: 9 )

Date of Publication:

Sept. 2004

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.