Loading...
Please wait, while we are loading the content...
Similar Documents
Fast decoding of rate-compatible punctured ldpc codes.
| Content Provider | CiteSeerX |
|---|---|
| Author | Kwon, Jini Klinc, Demijan Ha, Jeongseok Mclaughlin, Steven W. |
| Abstract | Abstract — While rate-compatible punctured low-density parity-check (RCP-LDPC) codes offer high flexibility in terms of code rate at a relatively low cost in implementation complexity, they are reported to require more decoding iterations than unpunctured LDPC codes. In this paper 1 we consider layered belief propagation decoding and propose efficient check node layering that significantly accelerates the decoding convergence of RCP-LDPC codes. We show that the proposed layering outperforms both random layering and conventional BP decoding. The performance improvements become more distinctive at high rates and they come at no additional implementation cost. I. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Rate-compatible Punctured Ldpc Code Fast Decoding Random Layering High Rate Low Cost Layered Belief Propagation Decoding Decoding Iteration Additional Implementation Cost Conventional Bp Decoding Propose Efficient Check Node Unpunctured Ldpc Code High Flexibility Rcp-ldpc Code Implementation Complexity Rate-compatible Punctured Low-density Parity-check Code Rate |
| Content Type | Text |
| Resource Type | Article |
