Construction of low-density parity-check codes by superposition

This paper presents a superposition method for constructing low-density parity-check (LDPC) codes. Several classes of structured LDPC codes are constructed. Codes in these classes perform well with iterative decoding, and their Tanner graphs have girth at least six.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on communications 2005-02, Vol.53 (2), p.243-251
Hauptverfasser:	Xu, J., Chen, L., Zeng, L., Lan, L., Lin, S.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Coding, codes Communications Society Computer errors Construction Decoding Exact sciences and technology Floors Graphs Information theory Information, signal and communications theory Iterative decoding NASA Parity check codes Quasi-cyclic low-density parity-check (LDPC) codes Reed-Solomon (RS) codes Shift registers Signal and communications theory Sparse matrices superposition Telecommunications and information theory Wireless communication
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	This paper presents a superposition method for constructing low-density parity-check (LDPC) codes. Several classes of structured LDPC codes are constructed. Codes in these classes perform well with iterative decoding, and their Tanner graphs have girth at least six.
ISSN:	0090-6778 1558-0857
DOI:	10.1109/TCOMM.2004.841966