{"title":"Comparison of computational complexity of adaptive equalization and OFDM for indoor wireless networks","authors":"James McDonnell, T. Wilkinson","doi":"10.1109/PIMRC.1996.568450","DOIUrl":null,"url":null,"abstract":"The computational requirements are investigated of conventional decision-feedback adaptive equalization using the least-mean-square (LMS) algorithm and orthogonal frequency division multiplexing (OFDM). This comparison was initiated to determine the least computationally intensive way of countering multipath effects in indoor wireless networks. Data rates examined ranged from 10 Mbits/s to 100 Mbits/s. For these data rates it was found that OFDM presents a significantly lower computational burden.","PeriodicalId":206655,"journal":{"name":"Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.1996.568450","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21
Abstract
The computational requirements are investigated of conventional decision-feedback adaptive equalization using the least-mean-square (LMS) algorithm and orthogonal frequency division multiplexing (OFDM). This comparison was initiated to determine the least computationally intensive way of countering multipath effects in indoor wireless networks. Data rates examined ranged from 10 Mbits/s to 100 Mbits/s. For these data rates it was found that OFDM presents a significantly lower computational burden.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
