The broadcast of repetition coding achieves the capacity bounds of decode-and-forward

M. Shaqfeh, H. Alnuweiri
{"title":"The broadcast of repetition coding achieves the capacity bounds of decode-and-forward","authors":"M. Shaqfeh, H. Alnuweiri","doi":"10.1109/ISWCS.2012.6328360","DOIUrl":null,"url":null,"abstract":"In FD-AWGN relay channel, the source sends the superposition of many capacity-achieving codewords. The relay decodes them using successive interference cancellation (SIC) and sends the superposition of the same codewords multiplied by random dither sequences and with a new power distribution among the codewords. The destination node decodes all code-words by removing the dithering and then applying maximal ratio combining and SIC in the same order used at the relay. We call this scheme the broadcast of repetition coding (BRC). We demonstrate that the achievable rate by the BRC scheme increases as the number of layers of the superposition coding increases and it achieves the capacity bounds of decode-forward when the number of layers grows to infinity. The design task of the BRC scheme is to optimize the power distribution over the added layers. This is obtained by solving first-order differential equations. We propose also a different two-layer scheme based on reverse order of SIC at the destination. This scheme is practical for implementation and achieves close-to-capacity rates. Our proposed schemes provide flexible alternatives to the cooperative coding schemes over relay channels.","PeriodicalId":167119,"journal":{"name":"2012 International Symposium on Wireless Communication Systems (ISWCS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Symposium on Wireless Communication Systems (ISWCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2012.6328360","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In FD-AWGN relay channel, the source sends the superposition of many capacity-achieving codewords. The relay decodes them using successive interference cancellation (SIC) and sends the superposition of the same codewords multiplied by random dither sequences and with a new power distribution among the codewords. The destination node decodes all code-words by removing the dithering and then applying maximal ratio combining and SIC in the same order used at the relay. We call this scheme the broadcast of repetition coding (BRC). We demonstrate that the achievable rate by the BRC scheme increases as the number of layers of the superposition coding increases and it achieves the capacity bounds of decode-forward when the number of layers grows to infinity. The design task of the BRC scheme is to optimize the power distribution over the added layers. This is obtained by solving first-order differential equations. We propose also a different two-layer scheme based on reverse order of SIC at the destination. This scheme is practical for implementation and achieves close-to-capacity rates. Our proposed schemes provide flexible alternatives to the cooperative coding schemes over relay channels.
重复编码的广播实现了译码转发的容量界限
在FD-AWGN中继信道中,源发送多个容量实现码字的叠加。继电器使用连续干扰抵消(SIC)对它们进行解码,并发送相同码字乘以随机抖动序列的叠加,并在码字之间具有新的功率分布。目标节点通过去除抖动来解码所有码字,然后以与中继相同的顺序应用最大比率组合和SIC。我们称这种方案为广播重复编码(BRC)。我们证明了BRC方案的可实现率随着叠加编码层数的增加而增加,当层数增加到无穷大时,BRC方案达到了前译码的容量界限。BRC方案的设计任务是优化在附加层上的功率分配。这是通过解一阶微分方程得到的。我们还提出了一种不同的基于目的地SIC反向顺序的双层方案。该方案易于实施,并可实现接近容量的速率。我们提出的方案为中继信道上的协作编码方案提供了灵活的替代方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信