Fast Decoding Algorithm for LDPC over GF ( 2 q )

@inproceedings{Barnault2016FastDA,
  title={Fast Decoding Algorithm for LDPC over GF ( 2 q )},
  author={L. Barnault and David Declercq},
  year={2016}
}
Abstract — In this paper, we present a modification of Belief Propagation that enable us to decode LDPC codes defined on high order Galois fields with a complexity that scales asp log2(p), p being the field order. With this low complexity algorithm, we are able to decodeGF(2) LDPC codes up to a field order value of256. We show by simulation that ultra-sparse regular LDPC codes in GF(64) and GF(256) exhibit very good performance. 
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 175 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 77 extracted citations

A reduced complexity decoding algorithm for NB-LDPC codes

2017 IEEE 17th International Conference on Communication Technology (ICCT) • 2017
View 5 Excerpts
Highly Influenced

Turbo code design for short blocks

2016 8th Advanced Satellite Multimedia Systems Conference and the 14th Signal Processing for Space Communications Workshop (ASMS/SPSC) • 2016
View 7 Excerpts
Highly Influenced

Simplified Symbol Flipping Algorithms for Nonbinary Low-Density Parity-Check Codes

IEEE Transactions on Communications • 2017
View 4 Excerpts
Highly Influenced

Two Enhanced Reliability-Based Decoding Algorithms for Nonbinary LDPC Codes

IEEE Transactions on Communications • 2016
View 10 Excerpts
Method Support
Highly Influenced

Performance Comparison of LDPC Block and Spatially Coupled Codes Over GF $(q)$

IEEE Transactions on Communications • 2015
View 6 Excerpts
Method Support
Highly Influenced

High-Throughput Non-Binary LDPC Decoder Based on Aggressive Overlap Scheduling

IEEE Transactions on Circuits and Systems I: Regular Papers • 2017
View 6 Excerpts
Highly Influenced

175 Citations

02040'14'15'16'17'18'19
Citations per Year
Semantic Scholar estimates that this publication has 175 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

TAP For Parity Check E rror Correcting Codes”, Aston University, Birmingham - United Kind

D. Saad, Y. Kabashima, R. Vicente
2001
View 1 Excerpt

M

M. Luby
Mitzenmacher, A.Shokrollahi, & D.Spielman, ”Analysis of low density codes and improved designs using irregular grap hs. In Proceedings of the 30th Annual ACM Symposium on the Theory of Com puting • 1998
View 1 Excerpt

Monte Carlo simulation of in fi ite low density parity check codes over GF(q)”, University of Cambr idge

D.J.C. MacKay, M. C. Davey
Cambridge - United Kindom, • 1998
View 2 Excerpts

Good Error-Correcting Codes Based on Very Sparse Matrices

IEEE Trans. Information Theory • 1997
View 1 Excerpt