Qingyun Fang, Yubing Han, Xuan Chen, Kai Qi, Mengyao Qi, Yi Zhang
{"title":"OFDM Channel Estimation Based on Fast Approximated Power Iteration Subspace Tracking","authors":"Qingyun Fang, Yubing Han, Xuan Chen, Kai Qi, Mengyao Qi, Yi Zhang","doi":"10.1145/3033288.3033321","DOIUrl":null,"url":null,"abstract":"Channel estimation is an important technique for OFDM. However, the traditional LMMSE algorithm and SVD algorithm have their own limitations in solving the problem of channel estimation. LMMSE has the highest accuracy, but the computational complexity of the algorithm is very high. Although the SVD algorithm can reduce the complexity of the algorithm, the complexity of the algorithm is not satisfactory. In addition, the SVD algorithm's requirement of storing large amounts of data has brought difficulties to the real-time processing. In this paper, we propose a fast power approximated iterative subspace tracking algorithm to achieve SVD. This algorithm greatly reduces the complexity of the computation on the basis of keeping a low bit error rate, so it has certain significance in practical engineering.","PeriodicalId":253625,"journal":{"name":"International Conference on Network, Communication and Computing","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Network, Communication and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3033288.3033321","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Channel estimation is an important technique for OFDM. However, the traditional LMMSE algorithm and SVD algorithm have their own limitations in solving the problem of channel estimation. LMMSE has the highest accuracy, but the computational complexity of the algorithm is very high. Although the SVD algorithm can reduce the complexity of the algorithm, the complexity of the algorithm is not satisfactory. In addition, the SVD algorithm's requirement of storing large amounts of data has brought difficulties to the real-time processing. In this paper, we propose a fast power approximated iterative subspace tracking algorithm to achieve SVD. This algorithm greatly reduces the complexity of the computation on the basis of keeping a low bit error rate, so it has certain significance in practical engineering.