{"title":"Approaching capacity on correlated fading channels with unknown state","authors":"Teng Li, Xiaowei Jin, O. Collins","doi":"10.1109/ISIT.2005.1523389","DOIUrl":null,"url":null,"abstract":"This paper presents a new coding scheme with capacity approaching performance for correlated fading channels with unknown state. The transceiver employs a deep interleaver to decompose the original channel into a bank of independent fading sub-channels. Sub-channels are successively decoded and decisions are fed back as new training symbols. The unknown state of each sub-channel can be estimated from past channel observations and future channel outputs. We show that the sub-channel has the same capacity as the original channel, given a sufficiently large estimation window. Therefore, the correlated fading channel capacity can be approached if each sub-channel uses an optimized capacity achieving code. Simulations show a universal performance within 1 dB of capacity upper bound regardless of fading rate. The scheme is also robust against decision feedback errors when the sub-channels use a long LDPC code","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2005.1523389","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
This paper presents a new coding scheme with capacity approaching performance for correlated fading channels with unknown state. The transceiver employs a deep interleaver to decompose the original channel into a bank of independent fading sub-channels. Sub-channels are successively decoded and decisions are fed back as new training symbols. The unknown state of each sub-channel can be estimated from past channel observations and future channel outputs. We show that the sub-channel has the same capacity as the original channel, given a sufficiently large estimation window. Therefore, the correlated fading channel capacity can be approached if each sub-channel uses an optimized capacity achieving code. Simulations show a universal performance within 1 dB of capacity upper bound regardless of fading rate. The scheme is also robust against decision feedback errors when the sub-channels use a long LDPC code