• DocumentCode
    2958402
  • Title

    A fast constant modulus algorithm for blind equalization

  • Author

    Nelatury, Sudarshan Rao ; Rao, Sathyanarayan S.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Villanova Univ., PA, USA
  • Volume
    2
  • fYear
    2000
  • fDate
    Oct. 29 2000-Nov. 1 2000
  • Firstpage
    1010
  • 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 /spl mu/ 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 variable step size, which increases the convergence rate.
  • Keywords
    blind equalisers; convergence of numerical methods; gradient methods; matrix algebra; search problems; CM algorithm; blind equalization; computationally efficient algorithm; convergence rate; equalizer coefficients initialization; fast constant modulus algorithm; fractionally spaced equalizer design; gradient search; misadjustment; scale factor; signed error CMA; step size; time decimated channel convolution matrix; variable step size; Blind equalizers; Convergence; Cost function; Digital communication; Digital filters; Dispersion; Filtering; Frequency; Intersymbol interference; Predistortion;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signals, Systems and Computers, 2000. Conference Record of the Thirty-Fourth Asilomar Conference on
  • Conference_Location
    Pacific Grove, CA, USA
  • ISSN
    1058-6393
  • Print_ISBN
    0-7803-6514-3
  • Type

    conf

  • DOI
    10.1109/ACSSC.2000.910666
  • Filename
    910666