English

Study of Structured Root-LDPC Codes and PEG Techniques for Block-Fading Channels

Information Theory 2015-12-09 v1 math.IT

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 F=2,3F = 2, 3 and 44 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 F=2F = 2 our proposed PEG-based Root-LDPC codes outperform PEG-based LDPC codes by 7.57.5dB at a FER close to 10310^{-3}.

Keywords

Cite

@article{arxiv.1512.02520,
  title  = {Study of Structured Root-LDPC Codes and PEG Techniques for Block-Fading Channels},
  author = {C. T. Healy and A. G. D. Uchoa and R. C. de Lamare},
  journal= {arXiv preprint arXiv:1512.02520},
  year   = {2015}
}

Comments

7 figures, 13 pages. arXiv admin note: text overlap with arXiv:1402.5692

R2 v1 2026-06-22T12:04:21.867Z