A fast constant modulus algorithm for blind equalization

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The constant modulus (CM) criterion coupled with a gradient search helps in the design of fractionally spaced equalizers. Effective implementation of CM algorithm requires proper choice of the scale factor μ called the step size and initialization of equalizer coefficients. Experience reveals that these two determine the convergence rate and final misadjustment. Recently Brown et al proposed a computationally efficient algorithm, which is a signed error version of CMA. This paper proposes yet another variation of the same and reports faster convergence. The idea is to use a variable step size, which increases the convergence rate.

Original languageEnglish (US)
Pages (from-to)1010-1013
Number of pages4
JournalConference Record of the Asilomar Conference on Signals, Systems and Computers
Volume2
StatePublished - 2000

Fingerprint

Blind equalization
Equalizers

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

@article{6a3be5240e6c47f286b2520eb7a2c241,
title = "A fast constant modulus algorithm for blind equalization",
abstract = "The constant modulus (CM) criterion coupled with a gradient search helps in the design of fractionally spaced equalizers. Effective implementation of CM algorithm requires proper choice of the scale factor μ called the step size and initialization of equalizer coefficients. Experience reveals that these two determine the convergence rate and final misadjustment. Recently Brown et al proposed a computationally efficient algorithm, which is a signed error version of CMA. This paper proposes yet another variation of the same and reports faster convergence. The idea is to use a variable step size, which increases the convergence rate.",
author = "Nelatury, {Sudarshan Rao} and Rao, {S. S.}",
year = "2000",
language = "English (US)",
volume = "2",
pages = "1010--1013",
journal = "Conference Record of the Asilomar Conference on Signals, Systems and Computers",
issn = "1058-6393",
publisher = "IEEE Computer Society",

}

TY - JOUR

T1 - A fast constant modulus algorithm for blind equalization

AU - Nelatury, Sudarshan Rao

AU - Rao, S. S.

PY - 2000

Y1 - 2000

N2 - The constant modulus (CM) criterion coupled with a gradient search helps in the design of fractionally spaced equalizers. Effective implementation of CM algorithm requires proper choice of the scale factor μ called the step size and initialization of equalizer coefficients. Experience reveals that these two determine the convergence rate and final misadjustment. Recently Brown et al proposed a computationally efficient algorithm, which is a signed error version of CMA. This paper proposes yet another variation of the same and reports faster convergence. The idea is to use a variable step size, which increases the convergence rate.

AB - The constant modulus (CM) criterion coupled with a gradient search helps in the design of fractionally spaced equalizers. Effective implementation of CM algorithm requires proper choice of the scale factor μ called the step size and initialization of equalizer coefficients. Experience reveals that these two determine the convergence rate and final misadjustment. Recently Brown et al proposed a computationally efficient algorithm, which is a signed error version of CMA. This paper proposes yet another variation of the same and reports faster convergence. The idea is to use a variable step size, which increases the convergence rate.

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

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

M3 - Article

VL - 2

SP - 1010

EP - 1013

JO - Conference Record of the Asilomar Conference on Signals, Systems and Computers

JF - Conference Record of the Asilomar Conference on Signals, Systems and Computers

SN - 1058-6393

ER -