An iterative decoding algorithm for rate-compatible punctured low-density parity-check codes of high coding rates

Gou Hosoya, Hideki Yagi, Manabu Kobayashi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications
Pages394-399
Number of pages6
DOIs
Publication statusPublished - 2010 Dec 1
Externally publishedYes
Event2010 20th International Symposium on Information Theory and Its Applications, ISITA 2010 and the 2010 20th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA 2010 - Taichung
Duration: 2010 Oct 172010 Oct 20

Other

Other2010 20th International Symposium on Information Theory and Its Applications, ISITA 2010 and the 2010 20th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA 2010
CityTaichung
Period10/10/1710/10/20

Fingerprint

Iterative decoding
Decoding

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems

Cite this

Hosoya, G., Yagi, H., & Kobayashi, M. (2010). An iterative decoding algorithm for rate-compatible punctured low-density parity-check codes of high coding rates. In ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications (pp. 394-399). [5649247] https://doi.org/10.1109/ISITA.2010.5649247

An iterative decoding algorithm for rate-compatible punctured low-density parity-check codes of high coding rates. / Hosoya, Gou; Yagi, Hideki; Kobayashi, Manabu.

ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications. 2010. p. 394-399 5649247.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hosoya, G, Yagi, H & Kobayashi, M 2010, An iterative decoding algorithm for rate-compatible punctured low-density parity-check codes of high coding rates. in ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications., 5649247, pp. 394-399, 2010 20th International Symposium on Information Theory and Its Applications, ISITA 2010 and the 2010 20th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA 2010, Taichung, 10/10/17. https://doi.org/10.1109/ISITA.2010.5649247
Hosoya G, Yagi H, Kobayashi M. An iterative decoding algorithm for rate-compatible punctured low-density parity-check codes of high coding rates. In ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications. 2010. p. 394-399. 5649247 https://doi.org/10.1109/ISITA.2010.5649247
Hosoya, Gou ; Yagi, Hideki ; Kobayashi, Manabu. / An iterative decoding algorithm for rate-compatible punctured low-density parity-check codes of high coding rates. ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications. 2010. pp. 394-399
@inproceedings{9dc4e44eea39436395ebf1506d5596e8,
title = "An iterative decoding algorithm for rate-compatible punctured low-density parity-check codes of high coding rates",
abstract = "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.",
author = "Gou Hosoya and Hideki Yagi and Manabu Kobayashi",
year = "2010",
month = "12",
day = "1",
doi = "10.1109/ISITA.2010.5649247",
language = "English",
isbn = "9781424460175",
pages = "394--399",
booktitle = "ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications",

}

TY - GEN

T1 - An iterative decoding algorithm for rate-compatible punctured low-density parity-check codes of high coding rates

AU - Hosoya, Gou

AU - Yagi, Hideki

AU - Kobayashi, Manabu

PY - 2010/12/1

Y1 - 2010/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=78651266529&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78651266529&partnerID=8YFLogxK

U2 - 10.1109/ISITA.2010.5649247

DO - 10.1109/ISITA.2010.5649247

M3 - Conference contribution

SN - 9781424460175

SP - 394

EP - 399

BT - ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications

ER -