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 条
  • [41] Reduced-complexity algorithms for near-optimal decoding of turbo TCM codes
    Sybis, M.
    Tyczka, P.
    Papaharalabos, S.
    Mathiopoulos, P. T.
    ELECTRONICS LETTERS, 2009, 45 (05) : 278 - 279
  • [42] Arikan Meets Shannon: Polar Codes with Near-Optimal Convergence to Channel Capacity
    Guruswami, Venkatesan
    Riazanov, Andrii
    Ye, Min
    PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, : 552 - 564
  • [43] CaTchDes: MATLAB codes for Caratheodory-Tchakaloff Near-Optimal Regression Designs
    Bos, Len
    Vianello, Marco
    SOFTWAREX, 2019, 10
  • [44] Arikan Meets Shannon: Polar Codes With Near-Optimal Convergence to Channel Capacity
    Guruswami, Venkatesan
    Riazanov, Andrii
    Ye, Min
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (05) : 2877 - 2919
  • [45] Near-Optimal Secret Sharing and Error Correcting Codes in AC0
    Cheng, Kuan
    Ishai, Yuval
    Li, Xin
    THEORY OF CRYPTOGRAPHY, TCC 2017, PT II, 2017, 10678 : 424 - 458
  • [46] On the Design of FSO-Based Satellite Systems Using Incremental Redundancy Hybrid ARQ Protocols With Rate Adaptation
    Le, Hoang D.
    Pham, Anh T.
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2022, 71 (01) : 463 - 477
  • [47] Near-optimal equalizer and timing adaptation for I/O links using a BER-based metric
    Chen, E-Hung
    Ren, Jihong
    Leibowitz, Brian
    Lee, Hae-Chang
    Lin, Qi
    Oh, Kyung Suk
    Lambrecht, Frank
    Stojanovic, Vladimir
    Zerbe, Jared
    Yang, Chih-Kong Ken
    IEEE JOURNAL OF SOLID-STATE CIRCUITS, 2008, 43 (09) : 2144 - 2156
  • [48] Round-Robin is Provably Near-Optimal for Minimizing Age with HARQ over Heterogeneous Unreliable Multiaccess Channels
    Jiang, Zhiyuan
    PROCEEDINGS OF THE 2020 32ND INTERNATIONAL TELETRAFFIC CONGRESS (ITC 32), 2020, : 46 - 54
  • [49] Patch-Based Near-Optimal Image Denoising
    Chatterjee, Priyam
    Milanfar, Peyman
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2012, 21 (04) : 1635 - 1649
  • [50] NEAR-OPTIMAL COLUMN-BASED MATRIX RECONSTRUCTION
    Boutsidis, Christos
    Drineas, Petros
    Magdon-Ismail, Malik
    SIAM JOURNAL ON COMPUTING, 2014, 43 (02) : 687 - 717