Symbol-level combining for hybrid ARQ on interference-aware successive decoding

H. Kwon, Jungwon Lee, Inyup Kang
{"title":"Symbol-level combining for hybrid ARQ on interference-aware successive decoding","authors":"H. Kwon, Jungwon Lee, Inyup Kang","doi":"10.1109/GLOCOM.2013.6831640","DOIUrl":null,"url":null,"abstract":"This paper proposes a symbol-level combining (SLC) scheme for hybrid automatic-repeat-request (HARQ), being used with an interference-aware successive decoding (IASD) algorithm [1]. Recently, it is revealed that the capacity in an interference channel over point-to-point codes can be achieved by combining two schemes: one is jointly decoding an interfering signal with a serving signal and the other is treating it as noise. Due to its high computational complexity, joint decoding can be practically replaced with successive decoding as suggested in [1]. However, when HARQ is enabled, it has been not well defined how interference should be handled at each transmission. Since interference is changed at each transmission, it is not helpful to store the information of interfering signals. Instead, the proposed scheme employes the decoded information of interfering signals in order to convert an interference channel to a point-to-point channel. The proposed scheme only requires a fixed size of memory and does not increase the detector complexity of IASD with respect to the number of retransmission. Simulation results demonstrate the superiority of the proposed scheme to the optimal SLC scheme at the conventional receiver.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"51 90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Global Communications Conference (GLOBECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2013.6831640","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper proposes a symbol-level combining (SLC) scheme for hybrid automatic-repeat-request (HARQ), being used with an interference-aware successive decoding (IASD) algorithm [1]. Recently, it is revealed that the capacity in an interference channel over point-to-point codes can be achieved by combining two schemes: one is jointly decoding an interfering signal with a serving signal and the other is treating it as noise. Due to its high computational complexity, joint decoding can be practically replaced with successive decoding as suggested in [1]. However, when HARQ is enabled, it has been not well defined how interference should be handled at each transmission. Since interference is changed at each transmission, it is not helpful to store the information of interfering signals. Instead, the proposed scheme employes the decoded information of interfering signals in order to convert an interference channel to a point-to-point channel. The proposed scheme only requires a fixed size of memory and does not increase the detector complexity of IASD with respect to the number of retransmission. Simulation results demonstrate the superiority of the proposed scheme to the optimal SLC scheme at the conventional receiver.
干扰感知连续译码中混合ARQ的符号级组合
本文提出了一种用于混合自动重复请求(HARQ)的符号级组合(SLC)方案,该方案与干扰感知连续解码(IASD)算法一起使用[1]。最近研究表明,点对点编码干扰信道的容量可以通过两种方案组合来实现:一种是将干扰信号与服务信号联合解码,另一种是将其作为噪声处理。由于联合译码的计算复杂度较高,可以采用[1]中提出的逐次译码来代替联合译码。然而,当启用HARQ时,还没有很好地定义在每次传输时应该如何处理干扰。由于每次传输时干扰都会发生变化,因此对存储干扰信号信息没有帮助。相反,所提出的方案利用干扰信号的解码信息,以便将干扰信道转换为点对点信道。该方案只需要固定大小的内存,并且相对于重传次数不会增加IASD的检测器复杂性。仿真结果表明,该方案优于传统接收机上的最优SLC方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信