Construction of Length and Rate Adaptive MET QC-LDPC Codes by Cyclic Group Decomposition

Author(s):  
Usatyuk Vasiliy ◽  
Egorov Sergey ◽  
German Svistunov
2019 ◽  
Vol 67 (6) ◽  
pp. 3879-3889 ◽  
Author(s):  
Fangping Ye ◽  
Elsa Dupraz ◽  
Zeina Mheich ◽  
Karine Amis

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
N. M. Masoodhu Banu ◽  
S. Sasikumar

A novel doping bits based belief propagation decoding algorithm, for rate-adaptive LDPC codes based on fixed bipartite graph code, is proposed. The proposed work modifies the decoding algorithm, by converting the puncturing nodes to regular source nodes and by following the encoding rule at the decoder. The transmitted doping bits in place of punctured bits, with the modified decoding algorithm at the decoder, feed all the punctured nodes with reliable log likelihood ratios. This enables the proposed decoding algorithm to recover all punctured nodes in the early iteration. The fast convergence leads to decoder complexity reduction while providing considerable improvement in performance.


Sign in / Sign up

Export Citation Format

Share Document