Fast decoding algorithm for LDPC over GF(2/sup q/)
- 2 March 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We present a modification of belief propagation that enables us to decode LDPC codes defined on high order Galois fields with a complexity that scales as p log/sub 2/ (p), p being the field order. With this low complexity algorithm, we are able to decode GF(2/sup q/) LDPC codes up to a field order value of 256. We show by simulation that ultra-sparse regular LDPC codes in GF(64) and GF(256) exhibit very good performance.Keywords
This publication has 3 references indexed in Scilit:
- Good error-correcting codes based on very sparse matricesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- TAP for Parity Check Error Correcting CodesPublished by MIT Press ,2001
- Analysis of low density codes and improved designs using irregular graphsPublished by Association for Computing Machinery (ACM) ,1998