{"title":"Deriving performance bounds for ISI channels using Gallager codes","authors":"A. Kavcic, B. Marcus, M. Mitzenmacher, B. Wilson","doi":"10.1109/ISIT.2001.936208","DOIUrl":null,"url":null,"abstract":"We develop density evolution methods for evaluating the performance of Gallager's low-density parity-check (LDPC) codes over binary intersymbol interference (ISI) channels. In contrast to previous work on memoryless channels, the noise tolerance thresholds for ISI channels depend on the transmitted sequences. The concentration statements are appropriately adjusted to reflect this difference. We compare the thresholds of regular Gallager codes over the 1-D partial response channel to the i.i.d. information rate, showing that at high code rates, regular Gallager codes are asymptotically optimal.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2001.936208","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
We develop density evolution methods for evaluating the performance of Gallager's low-density parity-check (LDPC) codes over binary intersymbol interference (ISI) channels. In contrast to previous work on memoryless channels, the noise tolerance thresholds for ISI channels depend on the transmitted sequences. The concentration statements are appropriately adjusted to reflect this difference. We compare the thresholds of regular Gallager codes over the 1-D partial response channel to the i.i.d. information rate, showing that at high code rates, regular Gallager codes are asymptotically optimal.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
