An upper bound of the step size for the gradient constant modulus algorithm

Grzegorz Dziwoki

doi:10.1117/12.674971

26 April 2006 An upper bound of the step size for the gradient constant modulus algorithm

Grzegorz Dziwoki

Proceedings Volume 6159, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments IV; 61594I (2006) https://doi.org/10.1117/12.674971
Event: Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments IV, 2005, Wilga, Poland

Abstract

The paper presents the theoretical derivation of an upper bound of the step size for the CM blind equalization algorithm. The analysis is performed under following assumptions, among other things: SISO (Single Input Single Output) channel model and whitening filtering before equalization procedure.

Citation Download Citation

Grzegorz Dziwoki "An upper bound of the step size for the gradient constant modulus algorithm", Proc. SPIE 6159, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments IV, 61594I (26 April 2006); https://doi.org/10.1117/12.674971

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