相关源对称分布式算法编码

Marco Grangetto, E. Magli, G. Olmo
{"title":"相关源对称分布式算法编码","authors":"Marco Grangetto, E. Magli, G. Olmo","doi":"10.1109/MMSP.2007.4412830","DOIUrl":null,"url":null,"abstract":"We propose a new scheme for symmetric Slepian-Wolf coding of correlated binary sources. Unlike previous designs that employ capacity-achieving channel codes, the proposed scheme is based on arithmetic codes with error correction capability. We define a time-sharing version of a distributed arithmetic coder, and a soft joint decoder. Experimental results on two sources show that, for short block length, the proposed scheme outperforms the symmetric turbo code design in (Stankovic et al., 2006).","PeriodicalId":225295,"journal":{"name":"2007 IEEE 9th Workshop on Multimedia Signal Processing","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Symmetric Distributed Arithmetic Coding of Correlated Sources\",\"authors\":\"Marco Grangetto, E. Magli, G. Olmo\",\"doi\":\"10.1109/MMSP.2007.4412830\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a new scheme for symmetric Slepian-Wolf coding of correlated binary sources. Unlike previous designs that employ capacity-achieving channel codes, the proposed scheme is based on arithmetic codes with error correction capability. We define a time-sharing version of a distributed arithmetic coder, and a soft joint decoder. Experimental results on two sources show that, for short block length, the proposed scheme outperforms the symmetric turbo code design in (Stankovic et al., 2006).\",\"PeriodicalId\":225295,\"journal\":{\"name\":\"2007 IEEE 9th Workshop on Multimedia Signal Processing\",\"volume\":\"106 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE 9th Workshop on Multimedia Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MMSP.2007.4412830\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE 9th Workshop on Multimedia Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMSP.2007.4412830","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

提出了一种新的相关二进制源对称Slepian-Wolf编码方案。与以往采用容量实现信道码的设计不同,该方案基于具有纠错能力的算术码。我们定义了一个分时版本的分布式算术编码器和一个软联合解码器。在两个源上的实验结果表明,对于较短的块长度,该方案优于(Stankovic et al., 2006)中的对称turbo码设计。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Symmetric Distributed Arithmetic Coding of Correlated Sources
We propose a new scheme for symmetric Slepian-Wolf coding of correlated binary sources. Unlike previous designs that employ capacity-achieving channel codes, the proposed scheme is based on arithmetic codes with error correction capability. We define a time-sharing version of a distributed arithmetic coder, and a soft joint decoder. Experimental results on two sources show that, for short block length, the proposed scheme outperforms the symmetric turbo code design in (Stankovic et al., 2006).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信