Name
Title | ||
|---|---|---|
Generalised Quasi-Cyclic LDPC codes based on Progressive Edge Growth Techniques for block fading channels |
Abstract | ||
|---|---|---|
Generalised Quasi-Cyclic Root-Check LDPC codes based on Progressive Edge Growth (PEG) techniques for block-fading channels are proposed. The proposed Root-Check LDPC codes are suitable for channels under F= 3, 4 independent fadings per codeword which is a scenario that has not been previously considered. A generalised Quasi-Cyclic Root-Check structure is devised for F= 3, 4 independent fadings. The proposed PEG-based algorithm for generalised Quasi-Cyclic Root-Check LDPC codes takes into account the specific structure, and designs a parity-check matrix with a reduced number of cycles. The performance of the new codes is investigated in terms of the Frame Error Rate (FER). Numerical results show that the codes constructed by the proposed algorithm perform about 0.5dB from the theoretical limit. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/ISWCS.2012.6328513 | Wireless Communication Systems |
Keywords | Field | DocType |
block codes,cyclic codes,fading channels,matrix algebra,parity check codes,FER,PEG techniques,block fading channels,frame error rate,generalised quasicyclic root-check LDPC codes,independent fadings,parity-check matrix,progressive edge growth techniques,LDPC,Outage Probability,PEG,Root-Check | Discrete mathematics,Algorithm design,Low-density parity-check code,Matrix (mathematics),Fading,Computer science,Turbo code,Signal-to-noise ratio,Block code,Algorithm,Real-time computing,Code word | Conference |
ISSN | ISBN | Citations |
2154-0217 E-ISBN : 978-1-4673-0760-4 | 978-1-4673-0760-4 | 16 |
PageRank | References | Authors |
0.57 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andre Gustavo Degraf Uchoa | 1 | 39 | 4.41 |
| Cornelius T. Healy | 2 | 94 | 8.96 |
| Rodrigo C. de Lamare | 3 | 1461 | 179.59 |
| Richard Demo Souza | 4 | 719 | 87.57 |