Variable-Length Coding With Shared Incremental Redundancy: Design Methods and Examples

被引:5
|
作者
Wang, Haobo [1 ]
Ranganathan, Sudarsan V. S. [2 ]
Wesel, Richard D. [3 ]
机构
[1] SK Hynix Memory Solut Amer Inc, San Jose, CA 95134 USA
[2] MIT, IDSS, Cambridge, MA 02142 USA
[3] Univ Calif Los Angeles, Dept Elect & Comp Engn, Los Angeles, CA 90095 USA
基金
美国国家科学基金会;
关键词
Forward error correction; incremental redundancy; feedback; channel capacity; broadcast; point-to-point; low density parity check codes; non-binary low density parity check codes; convolutional codes; variable-length coding; hybrid ARQ; CODED SLOTTED ALOHA; LDPC CODES; FEEDBACK;
D O I
10.1109/TCOMM.2019.2919626
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Variable-length (VL) coding with feedback is a commonly used technique that can approach point-to-point Shannon channel capacity with a significantly shorter average codeword length than fixed-length coding without feedback. This paper uses the inter-frame coding of Zeineddine and Mansour, originally introduced to address varying channel-state conditions in broadcast wireless communication, to approach capacity on point-to-point channels using VL codes without feedback. The per-symbol complexity is comparable to decoding the VL code with feedback (plus the additional complexity of a small peeling decoder amortized over many VL codes) and presents the opportunity for encoders and decoders that utilize massive parallel processing, where each VL decoder can process simultaneously. This paper provides an analytical framework and a design process for the degree distribution of the inter-frame code that allows the feedback-free system to achieve 96% or more of the throughput of the original VL code with feedback. As examples of VL codes, we consider non-binary (NB) low-density parity-check (LDPC), binary LDPC, and convolutional VL codes. The NB-LDPC VL code with an 8-bit CRC and an average codeword length of 336 bits achieves 85% of capacity with four rounds of ACK/NACK feedback. The proposed scheme using shared incremental redundancy without feedback achieves 97% of that performance or 83% of the channel capacity.
引用
收藏
页码:5981 / 5995
页数:15
相关论文
共 50 条
  • [31] Variable-length coding based on bent sequences for wireless advertising
    Rashid, E
    Yoshioka, Y
    Araki, T
    Nakamura, T
    PROCEEDINGS OF THE SIXTH IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, 2001, : 568 - 572
  • [32] Simple construction of quantum universal variable-length source coding
    Hayashi, M
    Matsumoto, K
    QUANTUM INFORMATION & COMPUTATION, 2002, 2 : 519 - 529
  • [33] Simple construction of quantum universal variable-length source coding
    Hayashi, Masahito
    Matsumoto, Keiji
    Quantum Information and Computation, 2002, 2 (SPEC. ISS.): : 519 - 529
  • [34] Simple construction of quantum universal variable-length source coding
    Hayashi, Masahito
    Matsumoto, Keiji
    Quantum Information and Computation, 2002, 2 (SUPPL. 1): : 519 - 529
  • [35] Private Variable-Length Coding with Non-zero Leakage
    Zamani, Amirreza
    Oechtering, Tobias J.
    Skoglund, Mikael
    2023 IEEE INTERNATIONAL WORKSHOP ON INFORMATION FORENSICS AND SECURITY, WIFS, 2023,
  • [36] Joint source-channel coding with variable-length codes
    Balakirskij, V.B.
    2001, Nauka Moscow (37):
  • [37] On variable-length coding of sources with side information at multiple decoders
    Tuncel, E
    Rose, K
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 140 - 140
  • [38] A novel class of variable-length lapped transform for image coding
    Tanaka, T
    Hirasawa, Y
    Yamashita, Y
    2003 INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOL 3, PROCEEDINGS, 2003, : 201 - 204
  • [39] Formalization of the Variable-Length Source Coding Theorem: Direct Part
    Obi, Ryosuke
    Hagiwara, Manabu
    Affeldt, Reynald
    2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA), 2014, : 201 - 205
  • [40] Variable-length coding with feedback in the non-asymptotic regime
    Polyanskiy, Yury
    Poor, H. Vincent
    Verdu, Sergio
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 231 - 235