Rate-Compatible Short-Length Protograph LDPC Codes
Thuy Van Nguyen, Aria Nosratinia, and Dariush Divsalar

TL;DR
This paper presents a novel rate-compatible protograph LDPC code at 1k blocklength that achieves excellent performance across different rates, overcoming design challenges associated with small block lengths and structured constraints.
Contribution
The paper introduces a new design method for rate-compatible protograph LDPC codes at short block lengths with superior error performance and no error floor down to very low FER levels.
Findings
Achieves no error floor down to FER of 10^-6
Supports rates from 1/3 to 4/5
Outperforms existing codes in waterfall and error floor regions
Abstract
This paper produces a rate-compatible protograph LDPC code at 1k information blocklength with superior performance in both waterfall and error floor regions. The design of such codes has proved difficult in the past because the constraints imposed by structured design (protographs), rate-compatibility, as well as small block length, are not easily satisfied together. For example, as the block length decreases, the predominance of decoding threshold as the main parameter in coding design is reduced, thus complicating the search for good codes. Our rate-compatible protograph codes have rates ranging from 1/3 to 4/5 and show no error floor down to FER.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Advanced Wireless Communication Techniques · Cooperative Communication and Network Coding
