Circulant search algorithm for the construction of QC-LDPC codes

Circulant search algorithm for the construction of QC-LDPC codes

A circulant permutation search algorithm is present in this paper, which can be employed to search appopriate circulant permutation to construct QC-LDPC codes with desired girth. The algorithm is based on a tree expansion mechanism and a select-and-discard procedure. By proposed method, a practical...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Xiongfei Tao, Xiaofeng Zhou, Deyu Feng, Lixin Zheng
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Bit error rate
Complexity theory
Iterative decoding
QC-LDPC codes
search algorithm
Simulation
Sparse matrices
tree expansion
Vegetation
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A circulant permutation search algorithm is present in this paper, which can be employed to search appopriate circulant permutation to construct QC-LDPC codes with desired girth. The algorithm is based on a tree expansion mechanism and a select-and-discard procedure. By proposed method, a practical (3, 4) code with code length n=37368 and girth g=18 is constructed. The experiment shows that the codes construct in this paper have large girth and minimum distance, and the bit error rate performance over AWGN channels is excellent.
DOI:10.1109/ICBNMT.2011.6155922