Increasing the speed of convergence of the constant modulus algorithm for blind channel equalization

Sudarshan Rao Nelatury, Sathyanarayan S. Rao

Research output: Contribution to journalArticlepeer-review

25 Scopus citations

Abstract

The constant modulus algorithm (CMA) is an excellent technique for blind channel equalization. Recently signed error version of CMA (SE-CMA) and dithered signed error version (DSE-CMA) have been proposed which afford overall computational efficiency. We propose three different error functions for faster convergence. This would be essential for communication systems, which cannot afford a high startup delay or for systems, where the channel's impulse response is rapidly fluctuating. One of these algorithms relies on the idea of a variable step size, which increases the rate of convergence.

Original languageEnglish (US)
Pages (from-to)872-876
Number of pages5
JournalIEEE Transactions on Communications
Volume50
Issue number6
DOIs
StatePublished - Jun 1 2002

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Increasing the speed of convergence of the constant modulus algorithm for blind channel equalization'. Together they form a unique fingerprint.

Cite this