Density evolution for the simultaneous decoding of LDPC-based slepian-wolf source codes

A. Eckford, Wei Yu
{"title":"Density evolution for the simultaneous decoding of LDPC-based slepian-wolf source codes","authors":"A. Eckford, Wei Yu","doi":"10.1109/ISIT.2005.1523573","DOIUrl":null,"url":null,"abstract":"This paper deals with the design and analysis of low-density parity-check (LDPC) codes for the Slepian-Wolf problem. The main contribution is a code design method based on a density evolution (DE) analysis for the cases where multiple LDPC codes are simultaneously decoded at the decoder. Good source codes are designed both for memoryless sources and sources with Markov memory. Further, simultaneous decoding is generalized to the case of source splitting, which allows non-corner points of the Slepian-Wolf region to be achieved even for sources with equiprobable marginal distributions","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"331 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","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.1523573","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

This paper deals with the design and analysis of low-density parity-check (LDPC) codes for the Slepian-Wolf problem. The main contribution is a code design method based on a density evolution (DE) analysis for the cases where multiple LDPC codes are simultaneously decoded at the decoder. Good source codes are designed both for memoryless sources and sources with Markov memory. Further, simultaneous decoding is generalized to the case of source splitting, which allows non-corner points of the Slepian-Wolf region to be achieved even for sources with equiprobable marginal distributions
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于ldpc的睡狼源代码同步解码的密度演化
本文研究了针对“睡狼”问题的低密度校验码的设计与分析。主要贡献是基于密度演化(DE)分析的码设计方法,用于在解码器上同时解码多个LDPC码的情况。好的源代码是为无记忆源和马尔可夫记忆源设计的。此外,同时解码被推广到源分裂的情况下,这使得即使具有等概率边缘分布的源也可以实现Slepian-Wolf区域的非角点
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
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
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1