Efficient Progressive Edge-Growth Algorithm Based on Chinese Remainder Theorem

Progressive edge-growth (PEG) algorithm construction builds a Tanner graph, or equivalently a parity-check matrix, for an LDPC code by establishing edges between the symbol nodes and the check nodes in an edge-by-edge manner and maximizing the girth in a greedy fashion. This approach is simple but t...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on communications 2014-02, Vol.62 (2), p.442-451
Hauptverfasser:	XUEQIN JIANG, XIA, Xiang-Gen, MOON HO LEE
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm design and analysis Algorithms Applied sciences Bit error rate Chinese remainder theorem (CRT) Coding, codes Complexity Complexity theory Construction Density Educational institutions Error correcting codes Exact sciences and technology girth Hardware Information, signal and communications theory LDPC codes Parity check codes Pattern recognition progressive edge-growth (PEG) algorithm Signal and communications theory Signal processing Simulation Symbols Telecommunications and information theory Theorems Vectors
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!