By Topic

Local convergence of the Sato blind equalizer and generalizations under practical constraints

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

4 Author(s)
Z. Ding ; Dept. of Electr. Eng., Auburn Univ., AL, USA ; R. A. Kennedy ; B. D. O. Anderson ; C. R. Johnson

An early use of recursive identification in blind adaptive channel equalization is an algorithm developed by Y. Sato (1975). An important generalization of the Sato algorithm with extensive analysis appears in the work of A. Benveniste et al. (1980). These generalized algorithms have been shown to possess a desirable global convergence property under two idealized conditions. The convergence properties of this class of blind algorithms under practical constraints common to a variety of channel equalization applications that violate these idealized conditions are studied. Results show that, in practice, when the equalizer is finite-dimensional and/or the input is discrete (as in digital communications) the equalizer parameters may converge to parameter settings that fail to achieve the objective of approximating the channel inverse. It is also shown that a center spike initialization is insufficient to guarantee avoiding such ill-convergence. Simulations verify the analytical results

Published in:

IEEE Transactions on Information Theory  (Volume:39 ,  Issue: 1 )