{"title":"An Accelerated Constant Modulus Algorithm","authors":"Magno T. M. Silva, M. Gerken, M. D. Miranda","doi":"10.14209/its.2002.405","DOIUrl":null,"url":null,"abstract":"— We present a novel adaptive algorithm for blind equalization. It is based on a tuner used in adaptive control that sets the second derivative of the parameter estimates and minimizes the cost function introduced by Go- dard. Based on simulation results we present a comparison with the Constant Modulus and the Shalvi-Weinstein algorithms. Both the convergence speed and the computational complexity of the proposed algorithm lie between those of the Constant Modulus and the Shalvi-Weinstein algorithms, thus present- ing a more favorable compromise between convergence speed and computational complexity. Some preliminary results also suggest that the proposed al- gorithm presents a more robust behavior with respect to convergence to global minima.","PeriodicalId":310988,"journal":{"name":"Anais do 2002 International Telecommunications Symposium","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Anais do 2002 International Telecommunications Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14209/its.2002.405","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
— We present a novel adaptive algorithm for blind equalization. It is based on a tuner used in adaptive control that sets the second derivative of the parameter estimates and minimizes the cost function introduced by Go- dard. Based on simulation results we present a comparison with the Constant Modulus and the Shalvi-Weinstein algorithms. Both the convergence speed and the computational complexity of the proposed algorithm lie between those of the Constant Modulus and the Shalvi-Weinstein algorithms, thus present- ing a more favorable compromise between convergence speed and computational complexity. Some preliminary results also suggest that the proposed al- gorithm presents a more robust behavior with respect to convergence to global minima.