.png){kind=icon}
返回
Rate-adaptive codes for distributed source coding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2006.03.012.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Source coding with correlated decoder side information is considered. We impose the practical constraint that the encoder be unaware of even the statistical dependencies between source and side information. Two classes of rate-adaptive distributed source codes, both based on low-density parity-check (LDPC) codes, are developed and their design is studied. Specific realizations are shown to be better than alternatives of linear encoding and decoding complexity. The proposed rate-adaptive LDPC accumulate (LDPCA) codes and sum LDPC accumulate (SLDPCA) codes (of length 6336 bits) perform within 10% and 5% of the Slepian-Wolf bound in the moderate and high rate regimes, respectively. (c) 2006 Elsevier B.V. All rights reserved.
Keyword:
distributed source coding
Slepian-Wolf theorem
side information
LDPC codes
iterative decoding algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.9K
被引数:
1.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
On the performance of hybrid FEC/ARQ systems using rate compatible punctured turbo (RCPT) codes
PREAI
分享收藏
查看更多内容