Low Complexity Bounds on a Class of Irregular LDPC Belief-Propagation Decoding Thresholds

Author(s):  
F. Vatta ◽  
A. Soranzo ◽  
M. Comisso ◽  
G. Buttazzoni ◽  
F. Babich
Author(s):  
Takumi Takahashi ◽  
Antti Tolli ◽  
Shinsuke Ibi ◽  
Seiichi Sampei

2017 ◽  
Vol 21 (1) ◽  
pp. 28-31 ◽  
Author(s):  
Chaudhry Adnan Aslam ◽  
Yong Liang Guan ◽  
Kui Cai ◽  
Guojun Han

2011 ◽  
Vol 128-129 ◽  
pp. 7-10
Author(s):  
Zhong Xun Wang ◽  
Xing Cheng Wang ◽  
Fang Qiang Zhu

We researched BP decoding algorithm based on variable-to-check information residual for LDPC code (VC-RBP) in this paper. It is a dynamic scheduling belief propagation using residuals, and has some advantages,such as fast decoding, good performance, and low complexity. It is similar to residual belief propagation (RBP),but has some difference in computing the residual message. This paper further optimized the new algorithm on DSP of TMS320dm6446, and it is good for hardware implementation.


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 159808-159820 ◽  
Author(s):  
Yaohan Wang ◽  
Shunqing Zhang ◽  
Chuan Zhang ◽  
Xiaojing Chen ◽  
Shugong Xu

Sign in / Sign up

Export Citation Format

Share Document