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 条
  • [21] Reliability-based incremental redundancy with convolutional codes
    Visotsky, E
    Sun, YK
    Tripathi, V
    Honig, ML
    Peterson, R
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2005, 53 (06) : 987 - 997
  • [22] Blind Demixing and Deconvolution at Near-Optimal Rate
    Jung, Peter
    Krahmer, Felix
    Stoeger, Dominik
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (02) : 704 - 727
  • [23] BOLA: Near-Optimal Bitrate Adaptation for Online Videos
    Spiteri, Kevin
    Urgaonkar, Rahul
    Sitaraman, Ramesh K.
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2020, 28 (04) : 1698 - 1711
  • [24] BOLA: Near-Optimal Bitrate Adaptation for Online Videos
    Spiteri, Kevin
    Urgaonkar, Rahul
    Sitaraman, Ramesh K.
    IEEE INFOCOM 2016 - THE 35TH ANNUAL IEEE INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS, 2016,
  • [25] Low-Rate Coding Using Incremental Redundancy for GLDPC Codes
    Cunche, Mathieu
    Savin, Valentin
    Roca, Vincent
    Kraidy, Ghassan
    Soro, Alexandre
    Lacan, Jerome
    2008 INTERNATIONAL WORKSHOP ON SATELLITE AND SPACE COMMUNICATIONS, CONFERENCE PROCEEDINGS, 2008, : 299 - +
  • [26] Weighting neurons by selectivity produces near-optimal population codes
    Zavitz, Elizabeth
    Price, Nicholas S. C.
    JOURNAL OF NEUROPHYSIOLOGY, 2019, 121 (05) : 1924 - 1937
  • [27] Near-Optimal Comparison Based Clustering
    Perrot, Michael
    Esser, Pascal Mattia
    Ghoshdastidar, Debarghya
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [28] Near-Optimal Decoding of Incremental Delta-Sigma ADC Output
    Wang, Bo
    Law, Man-Kay
    Belhaouari, Samir Brahim
    Bermak, Amine
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2020, 67 (11) : 3670 - 3680
  • [29] SHORT LINEAR INCREMENTAL REDUNDANCY CODES HAVING OPTIMAL WEIGHT STRUCTURE PROFILE
    CYGAN, D
    OFFER, E
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (01) : 192 - 195
  • [30] Analysis of reliability-based incremental redundancy with convolutional codes
    Visotsky, E
    Sun, YK
    Honig, M
    Tripathi, V
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 294 - 294