Rate-splitting and successive decoding for Gaussian interference channels

A. Haghi, A. Khandani
{"title":"Rate-splitting and successive decoding for Gaussian interference channels","authors":"A. Haghi, A. Khandani","doi":"10.1109/IWCIT.2016.7491616","DOIUrl":null,"url":null,"abstract":"Joint decoding is employed in many coding schemes to achieve a larger rate region. However, decoding complexity escalates considerably when joint decoding is used. This paper studies the achievable sum-rate of the two-user Gaussian interference channel when joint decoding is replaced by successive decoding. When interference is weak, it is shown that, for a wide range of transmitters' powers, rate-splitting and joint decoding are not required. A single split scheme with successive decoding achieves the Han-Kobayashi sum-rate. When rate-splitting is required, a novel rate-splitting scheme is proposed that does not use joint decoding. The number of required splits and the amount of power allocated to each split are expressed in closed forms. It is proved that the difference between the sum-rate of this scheme and that of the Han-Kobayashi scheme is bounded, even when transmitters' powers approach infinity.","PeriodicalId":414101,"journal":{"name":"2016 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"143 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Iran Workshop on Communication and Information Theory (IWCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWCIT.2016.7491616","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Joint decoding is employed in many coding schemes to achieve a larger rate region. However, decoding complexity escalates considerably when joint decoding is used. This paper studies the achievable sum-rate of the two-user Gaussian interference channel when joint decoding is replaced by successive decoding. When interference is weak, it is shown that, for a wide range of transmitters' powers, rate-splitting and joint decoding are not required. A single split scheme with successive decoding achieves the Han-Kobayashi sum-rate. When rate-splitting is required, a novel rate-splitting scheme is proposed that does not use joint decoding. The number of required splits and the amount of power allocated to each split are expressed in closed forms. It is proved that the difference between the sum-rate of this scheme and that of the Han-Kobayashi scheme is bounded, even when transmitters' powers approach infinity.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
高斯干扰信道的分频和连续译码
许多编码方案采用联合解码来实现更大的码率区域。然而,当使用联合解码时,解码的复杂性会大大增加。研究了用连续译码代替联合译码时双用户高斯干扰信道的可实现和率。在干扰较弱的情况下,对于较宽的发射机功率范围,不需要分频和联合解码。采用逐次解码的单分裂方案实现了汉-小林和率。在需要进行码率分割的情况下,提出了一种不使用联合解码的码率分割方案。所需分割的数量和分配给每个分割的功率以封闭形式表示。证明了该方案与Han-Kobayashi方案的和速率之差是有界的,即使发射机的功率趋近于无穷大。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Comparison between fractional Fourier transform-based single carrier and OFDM systems Rate-splitting and successive decoding for Gaussian interference channels Performance improvement of transmission links in overlay cognitive radio through interference alignment Asymmetric successive compute-and-forward Number of frequency slots in low collision Reed Solomon based frequency hopping sequences
×
引用
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