最大后验解码和turbo码一般无内存信道

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI:10.1109/ISIT.2005.1523540

C. Méasson, R. Urbanke, A. Montanari, T. Richardson

{"title":"最大后验解码和turbo码一般无内存信道","authors":"C. Méasson, R. Urbanke, A. Montanari, T. Richardson","doi":"10.1109/ISIT.2005.1523540","DOIUrl":null,"url":null,"abstract":"We derive further properties of EXIT and generalized EXIT curves. In particular we present an area theorem for iterative (as compared to MAP) decoding, we show how to compute upper-bounds on the MAP threshold for general channels and we apply these techniques to turbo codes","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Maximum a posteriori decoding and turbo codes for general memoryless channels\",\"authors\":\"C. Méasson, R. Urbanke, A. Montanari, T. Richardson\",\"doi\":\"10.1109/ISIT.2005.1523540\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We derive further properties of EXIT and generalized EXIT curves. In particular we present an area theorem for iterative (as compared to MAP) decoding, we show how to compute upper-bounds on the MAP threshold for general channels and we apply these techniques to turbo codes\",\"PeriodicalId\":166130,\"journal\":{\"name\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"volume\":\"106 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"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.1523540\",\"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. International Symposium on Information Theory, 2005. ISIT 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2005.1523540","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 18

摘要

进一步导出了EXIT曲线和广义EXIT曲线的性质。特别地，我们提出了迭代(与MAP相比)解码的面积定理，我们展示了如何计算一般信道MAP阈值的上界，并将这些技术应用于turbo码

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Maximum a posteriori decoding and turbo codes for general memoryless channels

We derive further properties of EXIT and generalized EXIT curves. In particular we present an area theorem for iterative (as compared to MAP) decoding, we show how to compute upper-bounds on the MAP threshold for general channels and we apply these techniques to turbo codes

求助全文

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

来源期刊

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.

自引率

0.00%

发文量

期刊最新文献

Upper bounds on the rate of LDPC codes as a function of minimum distance A wireless network can achieve maximum throughput without each node meeting all others Optimal linear decentralized estimation in a bandwidth constrained sensor network Near BER optimal partial response codes Bounds on mutual information rates of noisy channels with timing errors