Low Complexity Approach for High Throughput Belief-Propagation based Decoding of LDPC Codes

• Main Authors: BOT, A., BORDA, M., BELEAN, B., NEDEVSCHI, S.
• Format: Article
• Language: English
• Published: Stefan cel Mare University of Suceava 2013-11-01
• Series: Advances in Electrical and Computer Engineering
• Subjects: LDPC decoder; decoding algorithms; low-complexity; hardware implementations; belief propagation
• Online Access: http://dx.doi.org/10.4316/AECE.2013.04012
• ISSN: 1582-7445; 1844-7600

The paper proposes a low complexity belief propagation (BP) based decoding algorithm for LDPC codes. In spite of the iterative nature of the decoding process, the proposed algorithm provides both reduced complexity and increased BER performances as compared with the classic min-sum (MS) algorithm, generally used for hardware implementations. Linear approximations of check-nodes update function are used in order to reduce the complexity of the BP algorithm. Considering this decoding approach, an FPGA based hardware architecture is proposed for implementing the decoding algorithm, aiming to increase the decoder throughput. FPGA technology was chosen for the LDPC decoder implementation, due to its parallel computation and reconfiguration capabilities. The obtained results show improvements regarding decoding throughput and BER performances compared with state-of-the-art approaches.