FPGA-based low-complexity high-throughput tri-mode decoder for quasi-cyclic LDPC codes

Authors:
Xiaoheng Chen;Qin Huang;Shu Lin;Venkatesh Akella
Affiliations:
Department of Electrical and Computer Engineeringis, University of California, Davis, CA;Department of Electrical and Computer Engineeringis, University of California, Davis, CA;Department of Electrical and Computer Engineeringis, University of California, Davis, CA;Department of Electrical and Computer Engineeringis, University of California, Davis, CA
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 7
Cited 1

Optimal overlapped message passing decoding of quasi-cyclic LDPC codes

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Low-complexity high-speed decoder design for quasi-cyclic LDPC codes

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Accelerating FPGA-based emulation of quasi-cyclic LDPC codes with vector processing

Proceedings of the Conference on Design, Automation and Test in Europe
A hardware gaussian noise generator using the wallace method

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Good error-correcting codes based on very sparse matrices

IEEE Transactions on Information Theory
Low-density parity-check codes based on finite geometries: a rediscovery and new results

IEEE Transactions on Information Theory
Pseudo-Codeword Analysis of Tanner Graphs From Projective and Euclidean Planes

IEEE Transactions on Information Theory

Exploiting data-level parallelism for energy-efficient implementation of LDPC decoders and DCT on an FPGA

ACM Transactions on Reconfigurable Technology and Systems (TRETS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an FPGA-based implementation of a tri-mode decoder for decoding the cyclic (4095, 3367) Euclidean geometry LDPC code which has minimum distance 65 and no trapping set of size less than 65. The implementation integrates three compatible decoding algorithms in a single decoder. The three decoding algorithms are the one-step majority-logic decoding (OS-MLGD) algorithm and two iterative binary message passing algorithms (IBMP) derived from the OS-MLGD algorithm, one based on soft reliability information and the other on hard reliability information. All three algorithms requires only binary logical operations, integer additions, and single-bit messages, which makes them significantly less complex in terms of hardware requirements than sum-product algorithm, with a very modest loss in performance. The implementation is based on the partially parallel architecture and is optimized to take advantage of the high-speed dual-ported block RAMs in a Xilinx Virtex-4 FPGA. An optimization called memory sharing is introduced to take advantage of the configurable data width (word size) of the block RAMs to accommodate the 262080 edges in the Tanner graph of the (4095, 3367) code. A technique is introduced to decode two codewords simultaneously to take advantage of the depth of the block RAMs. As a result, the proposed implementation achieves a throughput of 1.9 Gbps on a Virtex- 4 LX160 FPGA and supports bit-error rate simulation down to 10-11 in a day or so.