Nonbinary LDPC codes constructed based on a cyclic MDS code and a low-complexity nonbinary message-passing decoding algorithm

In this letter, we propose a construction of nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes based on a cyclic maximum distance separable (MDS) code. The parity-check matrices are significantly rank deficient square matrices and their Tanner graphs have a girth of at least 6. The min...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE Communications Letters Jg. 14; H. 3; S. 239 - 241
Hauptverfasser: Chen, Chao, Bai, Baoming, Wang, Xinmei, Xu, Ming
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.03.2010
Institute of Electrical and Electronics Engineers (IEEE)
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Applied sciences
Chaotic communication
Coding, codes
Construction
Decoding
Exact sciences and technology
Fast Fourier transforms
Galois fields
High speed
Information, signal and communications theory
Integers
Iterative algorithms
Iterative decoding
Mathematical analysis
Matrices
Matrix methods
maximum distance separable (MDS) code
Nonbinary low-density parity-check (LDPC) code
nonbinary message-passing decoding
Parity check codes
plurality voting
Reed-Solomon codes
Signal and communications theory
Sparse matrices
Sum product algorithm
Telecommunications and information theory
Voting
Performance evaluation
Finite field
Cyclic code
Nonbinary low-density parity-check (LDPC) code
maximum distance separable (MDS) code
plurality voting iterative decoding
Storage system
Tanner graph
Iterative method
Algorithm
Iterative decoding
Field experiment
nonbinary message-passing decoding
Message passing
Simulation
Voting
Coding
Telecommunication system
Algorithm complexity
Electric power consumption
Error correcting code
Parity check codes
Minimal distance
Parity check
ISSN:1089-7798, 1558-2558
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this letter, we propose a construction of nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes based on a cyclic maximum distance separable (MDS) code. The parity-check matrices are significantly rank deficient square matrices and their Tanner graphs have a girth of at least 6. The minimum distances of the codes are very respectable as far as LDPC codes are concerned. Based on plurality voting and iterative mechanism, a low-complexity nonbinary massage-passing decoding algorithm is proposed. It only requires finite field operations, integer additions and integer comparisons. Simulation results show that the decoding algorithm is fit for the proposed codes, providing efficient trade-offs between performance and decoding complexity, which suggests that the coding scheme may find some applications in communication or storage systems with high-speed and low-power consumption requirements.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2010.03.092296