Repetition-Based NOMA-HARQ with Adaptive Termination for URLLC

Go Takita, Takanori Hara, Y. Yuda, K. Higuchi
{"title":"Repetition-Based NOMA-HARQ with Adaptive Termination for URLLC","authors":"Go Takita, Takanori Hara, Y. Yuda, K. Higuchi","doi":"10.1109/VTC2022-Fall57202.2022.10013081","DOIUrl":null,"url":null,"abstract":"This paper proposes a repetition-based low-latency non-orthogonal multiple access (NOMA)-hybrid automatic repeat request (HARQ) method with adaptive termination for ultra-reliable low latency communications (URLLC). To reduce transmission delay, the proposed method retransmits packets in short transmission time intervals in advance and terminates packet retransmissions adaptively according to acknowledgement (ACK) feedback from the receiver. In addition, to reduce the throughput loss due to unnecessary retransmitted packets sent in the time until ACK feedback, retransmitted packets of the URLLC user are non-orthogonally multiplexed in the same channel with packets of other users based on NOMA. Two non-orthogonal multiplexing methods are compared: superposition coding (SPC) and joint modulation (JM). As for the receiver structure, a successive interference canceller (SIC) and complexity reduced maximum likelihood detection (R-ML) are investigated. We confirm that the proposed method using JM and R-ML provides the best improvement in the transmission delay time versus throughput trade-off based on computer simulations.","PeriodicalId":326047,"journal":{"name":"2022 IEEE 96th Vehicular Technology Conference (VTC2022-Fall)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 96th Vehicular Technology Conference (VTC2022-Fall)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VTC2022-Fall57202.2022.10013081","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper proposes a repetition-based low-latency non-orthogonal multiple access (NOMA)-hybrid automatic repeat request (HARQ) method with adaptive termination for ultra-reliable low latency communications (URLLC). To reduce transmission delay, the proposed method retransmits packets in short transmission time intervals in advance and terminates packet retransmissions adaptively according to acknowledgement (ACK) feedback from the receiver. In addition, to reduce the throughput loss due to unnecessary retransmitted packets sent in the time until ACK feedback, retransmitted packets of the URLLC user are non-orthogonally multiplexed in the same channel with packets of other users based on NOMA. Two non-orthogonal multiplexing methods are compared: superposition coding (SPC) and joint modulation (JM). As for the receiver structure, a successive interference canceller (SIC) and complexity reduced maximum likelihood detection (R-ML) are investigated. We confirm that the proposed method using JM and R-ML provides the best improvement in the transmission delay time versus throughput trade-off based on computer simulations.
URLLC中基于重复的自适应终止NOMA-HARQ
针对超可靠低延迟通信(URLLC),提出了一种基于重复的低延迟非正交多址(NOMA)-自适应终止混合自动重复请求(HARQ)方法。为了减少传输延迟,该方法提前在较短的传输时间间隔内重传数据包,并根据接收方的确认(ACK)反馈自适应地终止数据包重传。此外,为了减少在收到ACK反馈之前的时间内发送不必要的重传报文造成的吞吐量损失,URLLC用户的重传报文基于NOMA与其他用户的报文在同一信道上进行非正交复用。比较了两种非正交复用方法:叠加编码和联合调制。在接收机结构方面,研究了逐次干扰消除(SIC)和复杂度降低的最大似然检测(R-ML)。基于计算机模拟,我们证实了使用JM和R-ML的方法在传输延迟时间与吞吐量权衡方面提供了最好的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信