Sum-subtract fixed point LDPC decoder

In this paper a low complexity loga- rithmic decoder for a LDPC code is presented. The performance of this decoding algorithm is similar to the original decoding algorithms, introduced by D. J. C. MacKay and R. M. Neal. It is a simplified algo- rithm that can be easily implemented on program- mable logic technology such as FPGA devices be- cause of its use of only additions and subtractions, avoiding the use of quotients and products, and of float point arithmetic. The algorithm yields a very low complexity programmable logic implementation of a LDPC decoder with an excellent BER perform- ance.

[1]  Lajos Hanzo,et al.  Comparative study of turbo decoding techniques: an overview , 2000, IEEE Trans. Veh. Technol..

[2]  D.J.C. MacKay,et al.  Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.

[3]  Hideki Imai,et al.  Reduced complexity iterative decoding of low-density parity check codes based on belief propagation , 1999, IEEE Trans. Commun..

[4]  N. Samayabalan,et al.  Comparitive study of turbo decoding techniques , 2008, 2008 International Conference on Computing, Communication and Networking.

[5]  Nasser Kehtarnavaz,et al.  Fixed Point DSP Implementation of Low-Density Parity Check Codes , 2000 .

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

[7]  Li Ping,et al.  Decoding low density parity check codes with finite quantization bits , 2000, IEEE Communications Letters.

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