Design of irregular LDPC codes with degree-set and degree-sum distributions
In this paper, we introduce new attributes of low-density parity-check graphs, degree-set and degree-sum, which explains the connectivity of a check node with more detail. Then, we consider more specified ensembles defined by degree-set/sum distribution of the graph than one defined by the degree di...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this paper, we introduce new attributes of low-density parity-check graphs, degree-set and degree-sum, which explains the connectivity of a check node with more detail. Then, we consider more specified ensembles defined by degree-set/sum distribution of the graph than one defined by the degree distribution. As the degree set/sum distribution varies, tradeoff between the performance at the waterfall and that at the error-floor is observed. The trade-off point can be managed by controlling degree-set/sum distribution. |
---|---|
ISSN: | 2166-9570 |
DOI: | 10.1109/PIMRC.2012.6362668 |