A fast constant modulus algorithm for blind equalization

Research output: Contribution to journalConference article

1 Scopus citations

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 - Dec 1 2000
Event34th Asilomar Conference - Pacific Grove, CA, United States
Duration: Oct 29 2000Nov 1 2000

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'A fast constant modulus algorithm for blind equalization'. Together they form a unique fingerprint.

  • Cite this