A massively scaleable decoder architecture for low-density parity-check codes

A massively scalable architecture for decoding low-density parity-check codes is presented in this paper. This novel architecture uses hardware scaling and memory partitioning to achieve a throughput of 100 Gbps. Simulation results show that this throughput is achieved without significant bit-error performance degradation.

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

[2]  Suresh Sivakumar.  VLSI implementation of encoder and decoder for low-density parity-check codes , 2001 .

[3]  Keshab K. Parhi,et al.  VLSI implementation-oriented (3, k)-regular low-density parity-check codes , 2001, 2001 IEEE Workshop on Signal Processing Systems. SiPS 2001. Design and Implementation (Cat. No.01TH8578).

[4]  Payam Pakzad,et al.  Abstract—two Decoding Schedules and the Corresponding Serialized Architectures for Low-density Parity-check (ldpc) , 2001 .

[5]  Tong Zhang,et al.  On finite precision implementation of low density parity check codes decoder , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).

[6]  Andrew J. Blanksby,et al.  Parallel decoding architectures for low density parity check codes , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).

[7]  Li Ping,et al.  Efficient implementation technique of LDPC decoder , 2001 .

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