Abstract
An improved iterative decoding algorithm of rate-compatible punctured low-density parity-check (RCP-LDPC) codes is developed. This algorithm performs a pre-determined 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.
| Original language | English |
|---|---|
| Pages (from-to) | 133-149 |
| Number of pages | 17 |
| Journal | Far East Journal of Electronics and Communications |
| Volume | 15 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2015 Dec 1 |
| Externally published | Yes |
Keywords
- BP decoding
- LDPC code
- Rate-compatible punctured code
ASJC Scopus subject areas
- Computer Science(all)
- Electrical and Electronic Engineering