By Topic

A moving window approach for blind equalization using subgradient projections

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)
C. Kizilkale ; Koc Univ., Istanbul, Turkey ; A. T. Erdogan

A novel blind equalization method based on a subgradient search over a convex cost surface is examined under a noisy channel and a modification is proposed. This is an alternative to the existing iterative blind equalization approaches such as constant modulus algorithm (CMA) which mostly suffer from the convergence problems caused by their non-convex cost functions. The proposed method is an iterative algorithm, for both real and complex constellations, with a very simple update rule that minimizes the l norm of the equalizer output under a linear constraint on the equalizer coefficients. The subgradient based algorithm has a fast convergence behavior attributed to the convex l cost surface. A moving window based approach is used in this algorithm to both decrease the algorithm's complexity and increase its immunity to noise.

Published in:

Signal Processing and Communications Applications Conference, 2004. Proceedings of the IEEE 12th

Date of Conference:

28-30 April 2004