Study of Structured Root-LDPC Codes and PEG Techniques for Block-Fading Channels
C. T. Healy, A. G. D. Uchoa, R. C. de Lamare

TL;DR
This paper introduces structured Root-LDPC codes designed with PEG techniques for block-fading channels, demonstrating significant performance improvements and diversity gains over standard LDPC codes.
Contribution
It proposes novel Quasi-Cyclic, Irregular repeat-accumulate, and Controlled Doping Root-LDPC codes tailored for multiple fading scenarios using PEG-based design.
Findings
Root-LDPC codes outperform standard LDPC codes in FER.
PEG-based Root-LDPC codes achieve 7.5 dB gain at FER of 10^{-3} for F=2.
Codes effectively exploit channel diversity.
Abstract
In this work, we propose structured Root-Low-Density Parity-Check (LDPC) codes and design techniques for block-fading channels. In particular, Quasi-Cyclic Root-LDPC codes, Irregular repeat-accumulate Root-LDPC codes and Controlled Doping Root-LDPC codes based on Progressive Edge Growth (PEG) techniques for block-fading channels are proposed. The proposed Root-LDPC codes are both suitable for channels under and independent fading per codeword. The performance of the proposed codes is investigated in terms of Frame Error Rate (FER). The proposed Root-LDPC codes are capable of achieving the channel diversity and outperform standard LDPC codes. For block-fading channel with our proposed PEG-based Root-LDPC codes outperform PEG-based LDPC codes by dB at a FER close to .
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
