{"title":"Low complexity iterative MLSE equalization of M-QAM signals in extremely long Rayleigh fading channels","authors":"H. Myburgh, J. Olivier","doi":"10.1109/EURCON.2009.5167861","DOIUrl":null,"url":null,"abstract":"This work proposes a neural network based iterative Maximum Likelihood Sequence Estimation (MLSE) equalizer, able to equalize signals in M-arry Quadrature Amplitude Modulation (M-QAM) modulated systems in a mobile fading environment with extremely long channels. Its computational complexity is linear in the data block length and approximately independent of the channel memory length, whereas conventional equalization algorithms have computational complexity linear in the data block length but exponential in the channel memory length. Its performance is compared to the Viterbi MLSE equalizer for short channels and it is shown that the proposed equalizer has the ability to equalize M-QAM signals in systems with hundreds of memory elements, achieving matched filter bound performance with perfect channel state information (CSI) knowledge in uncoded systems. The proposed equalizer is evaluated in a frequency selective Rayleigh fading environment.","PeriodicalId":256285,"journal":{"name":"IEEE EUROCON 2009","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE EUROCON 2009","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EURCON.2009.5167861","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
This work proposes a neural network based iterative Maximum Likelihood Sequence Estimation (MLSE) equalizer, able to equalize signals in M-arry Quadrature Amplitude Modulation (M-QAM) modulated systems in a mobile fading environment with extremely long channels. Its computational complexity is linear in the data block length and approximately independent of the channel memory length, whereas conventional equalization algorithms have computational complexity linear in the data block length but exponential in the channel memory length. Its performance is compared to the Viterbi MLSE equalizer for short channels and it is shown that the proposed equalizer has the ability to equalize M-QAM signals in systems with hundreds of memory elements, achieving matched filter bound performance with perfect channel state information (CSI) knowledge in uncoded systems. The proposed equalizer is evaluated in a frequency selective Rayleigh fading environment.