A Study on Scheduling with Greedy Belief Propagation for Decoding of LDPC Codes
碩士 === 國立交通大學 === 電信工程研究所 === 106 === Since low-density parity-check (LDPC)codes have the powerful capability of error correction, they have been widely adopted for data protection in many communication standards. The sum-product algorithm is often used for decoding LDPC codes. In some researches, i...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/9q8d3x |
| Summary: | 碩士 === 國立交通大學 === 電信工程研究所 === 106 === Since low-density parity-check (LDPC)codes have the powerful capability of error correction, they have been widely adopted for data protection in many communication standards. The sum-product algorithm is often used for decoding LDPC codes. In some researches, it has been found that dynamic scheduling can result in faster convergence speed or better error rate performance than the sum-product algorithm.
There are two kinds of dynamic scheduling based on different forms of residual; one is about the stability of message , and the other one is about the reliability of message. In these two kinds of dynamic scheduling, the message which has the largest residual will be picked up for updating in each sub-iteration. The purpose of this study is to propose a greedy way of belief propagation in the process of sub-iteration. By experimental results, our research found that adding the idea of greedy way belief propagation in dynamic scheduling can improve the convergence speed or error rate performance compared with the conventional designs.
|
|---|