Low Complexity Approach for High Throughput Belief-Propagation based Decoding of LDPC Codes
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,...
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: | |
Online Access: | http://dx.doi.org/10.4316/AECE.2013.04012 |
Similar Items
-
Residual-Decaying-Based Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes
by: Huilian Zhang, et al.
Published: (2019-01-01) -
Design of A Parallel Decoding Method for LDPC Code Generated via Primitive Polynomial
by: Zhe Zhang, et al.
Published: (2021-02-01) -
The decoding schemes of LDPC-codes. The efficiency ratings, advantages and further developments of LDPC-codes
by: A. G. Soltanov
Published: (2010-06-01) -
Decoder-in-the-Loop: Genetic Optimization-Based LDPC Code Design
by: Ahmed Elkelesh, et al.
Published: (2019-01-01) -
An adaptive low-power LDPC decoder using SNR estimation
by: Park Joo-Yul, et al.
Published: (2011-01-01)