使用Gallager码推导ISI信道的性能界限

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI:10.1109/ISIT.2001.936208

A. Kavcic, B. Marcus, M. Mitzenmacher, B. Wilson

{"title":"使用Gallager码推导ISI信道的性能界限","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":"{\"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}","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

摘要

我们发展密度演化方法来评估Gallager的低密度奇偶校验(LDPC)码在二进制码间干扰(ISI)信道上的性能。与以往对无记忆信道的研究相比，ISI信道的噪声容忍阈值取决于传输序列。浓度报表经过适当调整以反映这一差异。我们比较了一维部分响应信道上正则Gallager码的阈值与i.i.d信息率，表明在高码率下，正则Gallager码是渐近最优的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Deriving performance bounds for ISI channels using Gallager codes

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)

自引率

0.00%

发文量