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

Sudarshan Rao Nelatury, Sathyanarayan S. Rao

Research output: Contribution to journalArticle

24 Citations (Scopus)

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

Fingerprint

Computational efficiency
Impulse response
Communication systems

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

@article{8d98ac18e0fb41eb890c75b3675ac43d,
title = "Increasing the speed of convergence of the constant modulus algorithm for blind channel equalization",
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.",
author = "Nelatury, {Sudarshan Rao} and Rao, {Sathyanarayan S.}",
year = "2002",
month = "6",
day = "1",
doi = "10.1109/TCOMM.2002.1010603",
language = "English (US)",
volume = "50",
pages = "872--876",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

Increasing the speed of convergence of the constant modulus algorithm for blind channel equalization. / Nelatury, Sudarshan Rao; Rao, Sathyanarayan S.

In: IEEE Transactions on Communications, Vol. 50, No. 6, 01.06.2002, p. 872-876.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Nelatury, Sudarshan Rao

AU - Rao, Sathyanarayan S.

PY - 2002/6/1

Y1 - 2002/6/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0036602419&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036602419&partnerID=8YFLogxK

U2 - 10.1109/TCOMM.2002.1010603

DO - 10.1109/TCOMM.2002.1010603

M3 - Article

AN - SCOPUS:0036602419

VL - 50

SP - 872

EP - 876

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 6

ER -