Design of High-Rate LDPC Codes Based on Matroid Theory

In this letter, sufficient conditions for the determination of the girth are studied from the perspective of matroid theory. The girth of a Tanner graph is at least 2(t 1 + 2) if t 1 specific conditions are simultaneously met. A novel method of constructing high-rate low-density parity-check (LDPC)...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE communications letters 2019-12, Vol.23 (12), p.2146-2149
Hauptverfasser: Wu, Guangfu, Lv, Yijie, He, Jiguang
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this letter, sufficient conditions for the determination of the girth are studied from the perspective of matroid theory. The girth of a Tanner graph is at least 2(t 1 + 2) if t 1 specific conditions are simultaneously met. A novel method of constructing high-rate low-density parity-check (LDPC) codes is proposed based on the matroid theory. The parity-check matrices of the constructed LDPC codes are in the form of H = [I|H 2 ] with H 2 constructed under the conditions of a given girth and a fixed column weight (e.g., W c = 4 or W c = 6). Simulation results verify that the proposed LDPC codes outperform those in the literature over additive white Gaussian noise channels in terms of bit error rate performance.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2019.2940977