Joint source-channel coding of binary sources with side information at the decoder using IRA codes

A. Liveris, Zixiang Xiong, C. Georghiades
{"title":"Joint source-channel coding of binary sources with side information at the decoder using IRA codes","authors":"A. Liveris, Zixiang Xiong, C. Georghiades","doi":"10.1109/MMSP.2002.1203246","DOIUrl":null,"url":null,"abstract":"We use systematic irregular repeat accumulate (IRA) codes as source-channel codes for the transmission of an equiprobable memoryless binary source with side information at the decoder. A special case of this problem is joint source-channel coding for a nonequiprobable memoryless binary source. The theoretical limits of this problem are given by combining the Slepian-Wolf theorem, the source entropy in the special case, with the channel capacity. The approach is based on viewing the correlation between the binary source output and the side information as a separate channel or an enhancement of the original channel. The joint source-channel encoding, decoding and code design procedures are explained in detail. The simulated performance results are better than the recently published solutions using turbo codes and very close to the theoretical limit.","PeriodicalId":398813,"journal":{"name":"2002 IEEE Workshop on Multimedia Signal Processing.","volume":"424 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"95","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 IEEE Workshop on Multimedia Signal Processing.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMSP.2002.1203246","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 95

Abstract

We use systematic irregular repeat accumulate (IRA) codes as source-channel codes for the transmission of an equiprobable memoryless binary source with side information at the decoder. A special case of this problem is joint source-channel coding for a nonequiprobable memoryless binary source. The theoretical limits of this problem are given by combining the Slepian-Wolf theorem, the source entropy in the special case, with the channel capacity. The approach is based on viewing the correlation between the binary source output and the side information as a separate channel or an enhancement of the original channel. The joint source-channel encoding, decoding and code design procedures are explained in detail. The simulated performance results are better than the recently published solutions using turbo codes and very close to the theoretical limit.
在解码器处使用IRA码对带有侧信息的二进制源进行联合信路编码
我们使用系统不规则重复累加码(IRA)作为信源信道码,在解码器处传输具有侧信息的等概率无记忆二进制信源。该问题的一个特例是非等概率无内存二进制源的联合信信道编码。结合Slepian-Wolf定理、特殊情况下的源熵和信道容量给出了该问题的理论极限。该方法是基于查看二进制源输出和侧信息之间的相关性作为一个单独的通道或原始通道的增强。详细阐述了源信道联合编码、解码和码的设计过程。模拟的性能结果比最近发表的使用turbo码的解决方案更好,并且非常接近理论极限。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信