Abstract
We introduce successive cancellation (SC) decoding of product codes (PCs) with single parity-check (SPC) component codes. Recursive formulas are derived, which resemble the SC decoding algorithm of polar codes. We analyze the error probability of SPC-PCs over the binary erasure channel under SC decoding. A bridge with the analysis of PCs introduced by Elias in 1954 is also established. Furthermore, bounds on the block error probability under SC decoding are provided, and compared to the bounds under the original decoding algorithm proposed by Elias. It is shown that SC decoding of SPC-PCs achieves a lower block error probability than Elias’ decoding.
| Original language | English |
|---|---|
| Title of host publication | IEEE International Symposium on Information Theory (ISIT), 2017 |
| Place of Publication | Aachen, Germany |
| Publisher | IEEE - Institute of Electrical and Electronics Engineers Inc. |
| Pages | 1763-1767 |
| ISBN (Electronic) | 978-1-5090-4096-4 |
| DOIs | |
| Publication status | Published - 2017 Jun |
| Event | IEEE International Symposium on Information Theory (ISIT), 2017 - Aachen, Germany Duration: 2017 Jun 25 → 2017 Jun 30 |
Conference
| Conference | IEEE International Symposium on Information Theory (ISIT), 2017 |
|---|---|
| Country/Territory | Germany |
| City | Aachen |
| Period | 2017/06/25 → 2017/06/30 |
Subject classification (UKÄ)
- Engineering and Technology
- Electrical Engineering, Electronic Engineering, Information Engineering