Open AccessLow Complexity Approach for High Throughput Belief-Propagation based Decoding of LDPC Codes
Author(s) -
Bogdan Belean,
Monica Borda,
A. Bot,
Sergiu Nedevschi
Publication year - 2013
Publication title -
advances in electrical and computer engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.254
H-Index - 23
eISSN - 1844-7600
pISSN - 1582-7445
DOI - 10.4316/aece.2013.04012
Subject(s) - belief propagation , low density parity check code , decoding methods , computer science , throughput , berlekamp–welch algorithm , sequential decoding , list decoding , algorithm , factor graph , computational complexity theory , theoretical computer science , concatenated error correction code , error floor , block code , wireless , telecommunications
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