By Topic

Fast decoding algorithm for LDPC over GF(2q)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Barnault, L. ; ENSEA, Cergy, France ; Declercq, D.

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 log2 (p), p being the field order. With this low complexity algorithm, we are able to decode GF(2q) 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.

Published in:

Information Theory Workshop, 2003. Proceedings. 2003 IEEE

Date of Conference:

31 March-4 April 2003