{"title":"Low complexity bit mapping algorithm for multi-carrier communication systems with fading channels","authors":"Joonsuk Kim, Jiunn-Tsair Chen, J. Cioffi","doi":"10.1109/ICUPC.1998.733645","DOIUrl":null,"url":null,"abstract":"This paper presents a new bit loading algorithm to adaptively assign data bits to subchannels in a multi-carrier system. A low complexity mapping scheme using an adjustable look-up table to accommodate a time varying channel is introduced. In this way, as long as the feedback channel is secured, the proposed algorithm can perform well even in a fading channel due to its significantly reduced complexity, while a conventional bit loading algorithm may totally fail. This algorithm may also provide the best potentially implementable solution closer to the water-filling's by iteratively searching for the optimal bandwidth. The simulation result shows that this method is less sensitive to channel variation, which implies that it is robust to channel estimation errors.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICUPC.1998.733645","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13
Abstract
This paper presents a new bit loading algorithm to adaptively assign data bits to subchannels in a multi-carrier system. A low complexity mapping scheme using an adjustable look-up table to accommodate a time varying channel is introduced. In this way, as long as the feedback channel is secured, the proposed algorithm can perform well even in a fading channel due to its significantly reduced complexity, while a conventional bit loading algorithm may totally fail. This algorithm may also provide the best potentially implementable solution closer to the water-filling's by iteratively searching for the optimal bandwidth. The simulation result shows that this method is less sensitive to channel variation, which implies that it is robust to channel estimation errors.