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, 3$ and $4$ 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 = 2$ our proposed PEG-based Root-LDPC codes outperform PEG-based LDPC codes by $7.5$dB at a FER close to $10^{-3}$. |
Year | Venue | Field |
---|---|---|
2015 | CoRR | Discrete mathematics,BCJR algorithm,Concatenated error correction code,Luby transform code,Low-density parity-check code,Computer science,Serial concatenated convolutional codes,Turbo code,Block code,Algorithm,Theoretical computer science,Linear code |
DocType | Volume | Citations |
Journal | abs/1512.02520 | 0 |
PageRank | References | Authors |
0.34 | 23 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Cornelius T. Healy | 1 | 94 | 8.96 |
Andre Gustavo Degraf Uchoa | 2 | 39 | 4.41 |
Rodrigo C. de Lamare | 3 | 1461 | 179.59 |