{"title":"A fast constant modulus algorithm for blind equalization","authors":"S. Nelatury, Sathyanarayan S. Rao","doi":"10.1109/ACSSC.2000.910666","DOIUrl":null,"url":null,"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.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"52 1","pages":"1010-1013 vol.2"},"PeriodicalIF":0.0000,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2000.910666","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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.