Stop-and-go sign algorithms for blind equalization

Dimitrios Hatzinakos

doi:10.1117/12.49770

1 December 1991 Stop-and-go sign algorithms for blind equalization

Dimitrios Hatzinakos

Proceedings Volume 1565, Adaptive Signal Processing; (1991) https://doi.org/10.1117/12.49770
Event: San Diego, '91, 1991, San Diego, CA, United States

Abstract

Stop-and-go adaptation rules that are used to improve the blind convergence characteristics of the conventional and sign decision-directed algorithms are proposed and examined. They are based on the so-called Sato and Godard type errors which are commonly used in blind deconvolution applications. The convergence rates achieved by different algorithms with QAM type constellations are compared. Also, optimal values for the parameters that are used in the Sato and Godard errors and their effect to the convergence of the stop-and-go schemes are investigated by means of analysis and computer simulations.

Citation Download Citation

Dimitrios Hatzinakos "Stop-and-go sign algorithms for blind equalization", Proc. SPIE 1565, Adaptive Signal Processing, (1 December 1991); https://doi.org/10.1117/12.49770

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available