{"title":"Fast channel estimation techniques for LTE downlink systems based on fast linear Toeplitz system solver","authors":"Abdelhakim Khlifi, R. Bouallègue","doi":"10.1109/ICACT.2014.6779023","DOIUrl":null,"url":null,"abstract":"LTE is defined as the 4G generation network providing high data rates. Channel estimation is important in the wireless system conception. Classical LMMSE channel estimation techniques require O(N3) floating operations and O(N2) memory locations (N is the size of the channel autocorrelation). In this paper, we propose fast channel estimation techniques for LTE based on fast solver for linear Toeplitz system with reconstructible Cauchy-like structure. Proposed fast algorithms require only O(N2) floating operations and O(N) memory locations. Performances of proposed fast algorithms are verified via Monte-Carlo MATLAB simulations.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":"2 1","pages":"563-567"},"PeriodicalIF":0.0000,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"16th International Conference on Advanced Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACT.2014.6779023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
LTE is defined as the 4G generation network providing high data rates. Channel estimation is important in the wireless system conception. Classical LMMSE channel estimation techniques require O(N3) floating operations and O(N2) memory locations (N is the size of the channel autocorrelation). In this paper, we propose fast channel estimation techniques for LTE based on fast solver for linear Toeplitz system with reconstructible Cauchy-like structure. Proposed fast algorithms require only O(N2) floating operations and O(N) memory locations. Performances of proposed fast algorithms are verified via Monte-Carlo MATLAB simulations.