Complexity Analysis of Fourier-Transform Decoding of LDPC Codes over GF(q)

The complexity of Fourier-transform decoding of Low-Density Parity-Check (LDPC) codes over a finite field GF(2**p) is studied. The Fourier algorithm is found to have improved performance over GF(2) when column weight > 3.

By: Edward Ratzer

Published in: RZ3459 in


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .