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

2004267 citationsJournal Article

Authors

L. Barnault · École Nationale Supérieure de l'Électronique et de ses Applications

David Declercq · École Nationale Supérieure de l'Électronique et de ses Applications

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.

Topics & Keywords

Error Correcting Code Techniques Advanced Wireless Communication Techniques Cooperative Communication and Network Coding

Publication Details

DOI: 10.1109/itw.2003.1216697

Field-Weighted Citation Impact: 3.94

Command Palette

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

Authors

Abstract

Topics & Keywords

Publication Details