An iterative decoding algorithm for rate-compatible punctured low-density parity-check codes of high coding rates
An iterative decoding algorithm of rate-compatible punctured low-density parity-check (RCP-LDPC) codes of high coding rates is developed. This algorithm performs a predetermined recovering process of punctured bits sums at the beginning of each iteration of the standard belief-propagation (BP) decod...
Saved in:
| Published in: | 2010 International Symposium on Information Theory and Its Applications pp. 394 - 399 |
|---|---|
| Main Authors: | , , |
| Format: | Conference Proceeding |
| Language: | English Japanese |
| Published: |
IEEE
01.10.2010
|
| Subjects: | |
| ISBN: | 9781424460168, 1424460166 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | An iterative decoding algorithm of rate-compatible punctured low-density parity-check (RCP-LDPC) codes of high coding rates is developed. This algorithm performs a predetermined recovering process of punctured bits sums at the beginning of each iteration of the standard belief-propagation (BP) decoding algorithm. By propagating messages of two punctured bits sum, this algorithm can recover much more punctured bits than the standard BP decoding algorithm. It is shown that the proposed algorithm is applicable for RCP-LDPC codes of higher coding rates with little increase of decoding complexity. |
|---|---|
| ISBN: | 9781424460168 1424460166 |
| DOI: | 10.1109/ISITA.2010.5649247 |

