Abstract：As layered algorithm can not be used in the decoding of the “non-layered” LDPC codes, a Parallel- Layered Belief-Propagation (PLBP) algorithm is proposed in this paper. The decoding of this algorithm is quite different from the original layered algorithm, for it uses parallel updating among all layers and serial updating within each layer. With such a decoding schedule, a variable node in different layers is updated at different time, which means the message is able to be updated layer by layer for each variable node. The simulation shows the PLBP algorithm not only achieves a better error performance, but also requires almost 50% less iterations than the Flooding algorithm with the same complexity. Additionally, a merged computation of the nodes is employed by the PLBP algorithm. As a result, the decoding speed of the PLBP algorithm can reach nearly 4 times as that of the original Flooding algorithm.
2010, Vol. 32 
