Near-Optimal Rate Adaptation Based on Spinal Codes for Incremental Redundancy Truncated HARQ

被引:0
|
作者
Duan, Ruifeng [1 ]
Liu, Rongke [1 ]
Wang, Yan [1 ]
Sun, Jingyun [1 ]
Wang, Runxin [1 ]
机构
[1] Beihang Univ, Sch Elect & Informat Engn, Beijing, Peoples R China
关键词
Spinal codes; truncated HARQ; optimal rate adaptation; spectral efficiency; average delay;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper proposes a rate adaptation strategy based on Spinal codes, a novel rateless codes, in truncated incremental redundancy hybrid ARQ (HARQ) transmission. The information transmission between Satellite or deep space probes and ground receivers is considered. Too many retransmissions, which are caused by error frame, and long distance lead to considerable delay, up to several seconds. The delay is unacceptable. Especially when rigid delay requirements are imposed on communication system, retransmissions will impair communication quality significantly. Besides, channel state is time-varing because of atmospheric scintillation and rain attenuation. Only once transmission with lots of redundancy has a severe effect on spectral efficiency although it can decrease delay dramatically. How to maximize spectral efficiency under constraint on the frame error rate and transmission delay is key of this paper. We construct spectral efficiency optimal problem and get near-optimal rate distribution during transmission attempts. Simulations are implemented for proposed scheme at most twice transmission attempts with accurate and inaccurate SNR respectively, and the results show a significant improvement in spectral efficiency compared with conventional ACM-HARQ scheme.
引用
收藏
页码:256 / 261
页数:6
相关论文
共 50 条
  • [1] Rate Allocation and Adaptation for Incremental Redundancy Truncated HARQ
    Szczecinski, Leszek
    Khosravirad, Saeed R.
    Duhamel, Pierre
    Rahman, Moshiur
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2013, 61 (06) : 2580 - 2590
  • [2] Rate Adaptation for Incremental Redundancy Secure HARQ
    Mheich, Zeina
    Le Treust, Mael
    Alberge, Florence
    Duhamel, Pierre
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2016, 64 (02) : 765 - 777
  • [3] Constructions of Batch Codes with Near-Optimal Redundancy
    Vardy, Alexander
    Yaakobi, Eitan
    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 1197 - 1201
  • [4] On the Optimal Link Adaptation in Linear Relay Networks With Incremental Redundancy HARQ
    Kim, Seong Hwan
    Jung, Bang Chul
    IEEE COMMUNICATIONS LETTERS, 2014, 18 (08) : 1411 - 1414
  • [5] Designing Near-Optimal Steganographic Codes in Practice Based on Polar Codes
    Li, Weixiang
    Zhang, Weiming
    Li, Li
    Zhou, Hang
    Yu, Nenghai
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (07) : 3948 - 3962
  • [6] Linear-time encodable/decodable codes with near-optimal rate
    Guruswami, V
    Indyk, P
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (10) : 3393 - 3400
  • [7] Outage-Optimal Power Adaptation and Allocation for Truncated HARQ
    Jabi, Mohammed
    Szczecinski, Leszek
    Benjillali, Mustapha
    Labeau, Fabrice
    2014 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2014, : 1890 - 1896
  • [8] Variable-Rate Incremental-Redundancy HARQ for Finite Blocklengths
    Fu, Yu
    Lozano, Angel
    Yang, Hongwen
    IEEE OPEN JOURNAL OF THE COMMUNICATIONS SOCIETY, 2025, 6 : 1413 - 1422
  • [9] On some classes of optimal and near-optimal polynomial codes
    Aydin, N
    Ray-Chaudhuri, DK
    FINITE FIELDS AND THEIR APPLICATIONS, 2004, 10 (01) : 24 - 35
  • [10] Near-Optimal Resource Allocation for Type-II HARQ Based OFDMA Networks Under Rate and Power Constraints
    Ksairi, Nassar
    Ciblat, Philippe
    Le Martret, Christophe J.
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2014, 13 (10) : 5621 - 5634