Journal ArticleDOI
A Low Complexity Decoding Algorithm for Majority-Logic Decodable Nonbinary LDPC Codes
TLDR
A low complexity decoding algorithm for majority-logic decodable nonbinary low-density parity-check (LDPC) codes that requires only integer operations and finite field operations and can be implemented with simple combinational logic circuits in practical systems.Abstract:
In this letter, we propose a low complexity decoding algorithm for majority-logic decodable nonbinary low-density parity-check (LDPC) codes. The proposed algorithm is initialized with the quantized squared Euclidean distances between the constellation points and the received signals. Like most of the existing reliability-based decoding algorithms, the proposed algorithm requires only integer operations and finite field operations and (hence) can be implemented with simple combinational logic circuits in practical systems. Simulation results show that the proposed algorithm suffers from a little performance degradation compared with FFT-QSPA. The algorithm provides a candidate for trade-offs between performance and complexity.read more
Citations
More filters
Journal ArticleDOI
A Class of Nonbinary LDPC Codes with Fast Encoding and Decoding Algorithms
TL;DR: Simulation results show that the performance degradation caused by the iterative multistage decoding algorithms is relevant to the code structure and can be utilized to trade off the performance against the complexity.
Journal ArticleDOI
Low-Complexity Reliability-Based Message-Passing Decoder Architectures for Non-Binary LDPC Codes
Xinmiao Zhang,Fang Cai,Shu Lin +2 more
TL;DR: In this article, an iterative hard reliability-based majority-logic decoding (IHRB-MLGD) algorithm was proposed to achieve significant coding gain with small hardware overhead.
Journal ArticleDOI
Non-Binary LDPC Decoder Based on Symbol Flipping with Multiple Votes
TL;DR: This improved decoder makes use of a list of syndrome computations instead of a single one based on hard-decision, and builds soft information at the variable node input by assigning votes weighted by different amplitudes.
Journal ArticleDOI
Bit-Reliability Based Low-Complexity Decoding Algorithms for Non-Binary LDPC Codes
TL;DR: In this article, the authors proposed bit-reliability based majority-logic decoding (MLgD) algorithms for non-binary LDPC codes, which pass only one Galois field element and its reliability along each edge of the Tanner graph.
Journal ArticleDOI
A Variant of the EMS Decoding Algorithm for Nonbinary LDPC Codes
TL;DR: Simulation results show that the μ-EMS algorithm performs almost as well as the Q-ary sum-product algorithm (QSPA) and is simpler than the other X-EMS algorithms for NB-LDPC over high order finite fields.
References
More filters
Book
Low-Density Parity-Check Codes
TL;DR: A simple but nonoptimum decoding scheme operating directly from the channel a posteriori probabilities is described and the probability of error using this decoder on a binary symmetric channel is shown to decrease at least exponentially with a root of the block length.
Book
Error control coding : fundamentals and applications
Shu Lin,Daniel J. Costello +1 more
TL;DR: This book explains coding for Reliable Digital Transmission and Storage using Trellis-Based Soft-Decision Decoding Algorithms for Linear Block Codes and Convolutional Codes, and some of the techniques used in this work.
Journal ArticleDOI
Good error-correcting codes based on very sparse matrices
TL;DR: It is proved that sequences of codes exist which, when optimally decoded, achieve information rates up to the Shannon limit, and experimental results for binary-symmetric channels and Gaussian channels demonstrate that practical performance substantially better than that of standard convolutional and concatenated codes can be achieved.
Journal ArticleDOI
A recursive approach to low complexity codes
TL;DR: It is shown that choosing a transmission order for the digits that is appropriate for the graph and the subcodes can give the code excellent burst-error correction abilities.
Journal ArticleDOI
Low-density parity check codes over GF(q)
TL;DR: A significant improvement over the performance of the binary codes is found, including a rate 1/4 code with bit error probability <10/sup -5/ at E/sub b//N/sub 0/=0.2 dB.