Fast decoding algorithm for LDPC over GF(2/sup q/)

descriptionPublicationkeyboard_double_arrow_right Article 02 Mar 2004Publisher:IEEEJournal:Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)

Authors: L. Barnault; D. Declercq;

doi: 10.1109/itw.2003.1216697

Fast decoding algorithm for LDPC over GF(2/sup q/)

- Summary
- Metrics

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.

Related Organizations

École Nationale Supérieure de l'Électronique et de ses Applications
France

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	100
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%