On the Low Complexity Construction of Quasi-Cyclic Low-Density Parity-Check Codes by Progressive-Block Growth

2009 ◽  
Author(s):  
Qiangy Yuan ◽  
Pinyi Ren ◽  
Yilin Feng ◽  
Jun Wang
Keyword(s):  
Low Complexity ◽  
Low Density ◽  
Parity Check ◽  
Low Density Parity Check ◽  
Parity Check Codes ◽  
Block Growth

Modified Bit-Flipping Decoding of Low-Density Parity-Check Codes

2013 ◽  
Vol 710 ◽  
pp. 723-726
Author(s):  
Yuan Hua Liu ◽  
Mei Ling Zhang
Keyword(s):  
High Throughput ◽  
Error Probability ◽  
Ldpc Codes ◽  
Low Complexity ◽  
Low Density ◽  
Parity Check ◽  
Excellent Performance ◽  
Low Density Parity Check ◽  
Lower Complexity ◽  
Parity Check Codes

A novel bit-flipping (BF) algorithm with low complexity for high-throughput decoding of low-density parity-check (LDPC) codes is presented. At each iteration, a novel threshold pattern is used to determine the code bits whether to be flipped or not, and the flipping error probability is effectively decreased. Compared with the weighted BF algorithm and its modifications, the modified BF algorithm has significantly lower complexity and decoding time. Through simulations the proposed BF algorithm is shown to achieve excellent performance and fast convergence speed while maintaining significantly low complexity thus facilitating high-throughput decoding.

Sign in / Sign up

Export Citation Format

Share Document