{"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).