Fast decoding of regular LDPC codes using greedy approximation algorithms

2011 ◽  
Author(s):  
Nicholas Kalouptsidis ◽  
Nicholas Kolokotronis
Keyword(s):  
Approximation Algorithms ◽  
Ldpc Codes ◽  
Greedy Approximation ◽  
Fast Decoding

A BP Decoding Algorithm Based on Nodes Residual for LDPC Codes and its Hardware Implementation

2011 ◽  
Vol 128-129 ◽  
pp. 7-10
Author(s):  
Zhong Xun Wang ◽  
Xing Cheng Wang ◽  
Fang Qiang Zhu
Keyword(s):  
Hardware Implementation ◽  
Belief Propagation ◽  
Dynamic Scheduling ◽  
Ldpc Codes ◽  
Ldpc Code ◽  
Low Complexity ◽  
Decoding Algorithm ◽  
Fast Decoding ◽  
Good For

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.

Greedy approximation algorithms for directed multicuts

Networks ◽  
2005 ◽  
Vol 45 (4) ◽  
pp. 214-217 ◽  
Author(s):  
Yana Kortsarts ◽  
Guy Kortsarz ◽  
Zeev Nutov
Keyword(s):  
Approximation Algorithms ◽  
Greedy Approximation
Sign in / Sign up

Export Citation Format

Share Document