Selective avoidance of cycles in irregular LDPC code construction

This letter explains the effect of graph connectivity on error-floor performance of low-density parity-check (LDPC) codes under message-passing decoding. A new metric, called extrinsic message degree (EMD), measures cycle connectivity in bipartite graphs of LDPC codes. Using an easily computed estim...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on communications 2004-08, Vol.52 (8), p.1242-1247
Hauptverfasser:	Tao Tian, Jones, C.R., Villasenor, J.D., Wesel, R.D.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences AWGN Bipartite graph Bit error rate Clustering algorithms Coding, codes Decoding Degradation Exact sciences and technology Floors Information, signal and communications theory Iterative algorithms Parity check codes Signal and communications theory Telecommunications and information theory Tree graphs
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!