{"title":"An efficient Recursive Inverse adaptive filtering algorithm for channel equalization","authors":"Mohammad Shukri Ahmad, O. Kukrer, A. Hocanin","doi":"10.1109/EW.2010.5483397","DOIUrl":null,"url":null,"abstract":"Recursive Inverse (RI) adaptive filtering algorithm which uses a variable step-size and the instantaneous value of the autocorrelation matrix in the coefficient update equation was proposed in [1]. The algorithm was shown to have a higher performance compared with the RLS and RRLS algorithms. In this paper, a more efficient version with lower computational complexity is presented. The performance of the algorithm has been tested in a channel equalization setting and compared with those of the Recursive Least Squares (RLS) and Stabilized Fast Transversal Recursive Least Squares (SFTRLS) algorithms in Additive White Gaussian Noise (AWGN), Additive Correlated Gaussian Noise (ACGN), Additive White Impulsive Noise (AWIN) and Additive Correlated Impulsive Noise (ACIN) environments. Simulation results show that the Fast RI algorithm performs better than RLS and requires less computations. Additionally, the performance of the Fast RI algorithm is shown to be superior to that of the SFTRLS algorithm under the same conditions.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 European Wireless Conference (EW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EW.2010.5483397","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19
Abstract
Recursive Inverse (RI) adaptive filtering algorithm which uses a variable step-size and the instantaneous value of the autocorrelation matrix in the coefficient update equation was proposed in [1]. The algorithm was shown to have a higher performance compared with the RLS and RRLS algorithms. In this paper, a more efficient version with lower computational complexity is presented. The performance of the algorithm has been tested in a channel equalization setting and compared with those of the Recursive Least Squares (RLS) and Stabilized Fast Transversal Recursive Least Squares (SFTRLS) algorithms in Additive White Gaussian Noise (AWGN), Additive Correlated Gaussian Noise (ACGN), Additive White Impulsive Noise (AWIN) and Additive Correlated Impulsive Noise (ACIN) environments. Simulation results show that the Fast RI algorithm performs better than RLS and requires less computations. Additionally, the performance of the Fast RI algorithm is shown to be superior to that of the SFTRLS algorithm under the same conditions.