Paper Info
Title
Repeat Accumulate Based Designs for LDPC Codes on Fading Channels.
Abstract
Irregular repeat-accumulate Root-Check LDPC codes based on Progressive Edge Growth (PEG) techniques for block-fading channels are proposed. The proposed Root-Check LDPC codes are {both suitable for channels under $F = 2, 3$ independent fadings per codeword and} for fast fading channels. An IRA(A) Root-Check structure is devised for $F = 2, 3$ independent fadings. The performance of the new codes is investigated in terms of the Frame Error Rate (FER). Numerical results show that the IRAA LDPC codes constructed by the proposed algorithm {outperform by about 1dB the existing} IRA Root-Check LDPC codes under fast-fading channels.
Year
Venue
Field
2014
arXiv: Information Theory
Discrete mathematics,Forward error correction,Low-density parity-check code,Fading,Turbo code,Serial concatenated convolutional codes,Algorithm,Communication channel,Theoretical computer science,Code word,Mathematics,Fold (higher-order function)
DocType
Volume
Citations 
Journal
abs/1402.5692
0
PageRank 
References 
Authors
0.34
8
3
Name
Order
Citations
PageRank
Andre Gustavo Degraf Uchoa1394.41
Cornelius T. Healy2948.96
Rodrigo Caiado de Lamare302.03