An FPGA design of low power LDPC decoder for high-speed wireless LAN

This paper proposes three kinds of simplified complexity-reduced algorithms for a low density parity check (LDPC) decoder. First, sequential decoding using a partial group is proposed. Second, an early detection method for reducing the computational complexity is proposed. Finally, in order to support the high-speed systems, we implemented LDPC decoder using three algorithms by N=648, R=1/2. And the decoder runs at a clock speed of 10ns. Therefore we implemented the LDPC decoder with the decoding speed of 110Mbps.

[1]  D. Spielman,et al.  Expander codes , 1996 .

[2]  J. W. Bond,et al.  Constructing low-density parity-check codes , 2000, IEEE/AFCEA EUROCOMM 2000. Information Systems for Enhanced Public Safety and Security (Cat. No.00EX405).

[3]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[4]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[5]  Joseph R. Cavallaro,et al.  Configurable, High Throughput, Irregular LDPC Decoder Architecture: Tradeoff Analysis and Implementation , 2006, IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06).

[6]  Rüdiger L. Urbanke,et al.  Efficient encoding of low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[7]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.