Advanced

Successive Cancellation Decoding of Single Parity-Check Product Codes

Coskun, Mustafa Cemil; Liva, Gianluigi; Graell i Amat, Alexandre and Lentmaier, Michael LU (2017) IEEE International Symposium on Information Theory (ISIT), 2017 p.1763-1767
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.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
host publication
IEEE International Symposium on Information Theory (ISIT), 2017
pages
1763 - 1767
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
conference name
IEEE International Symposium on Information Theory (ISIT), 2017
conference location
Aachen, Germany
conference dates
2017-06-25 - 2017-06-30
external identifiers
  • scopus:85034071134
ISBN
978-1-5090-4096-4
DOI
10.1109/ISIT.2017.8006832
language
English
LU publication?
yes
id
b4bc54c2-adc0-4e7a-8493-3dc5a3c04115
date added to LUP
2017-11-27 18:52:22
date last changed
2018-11-21 21:36:16
@inproceedings{b4bc54c2-adc0-4e7a-8493-3dc5a3c04115,
  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.},
  author       = {Coskun, Mustafa Cemil and Liva, Gianluigi and Graell i Amat, Alexandre and Lentmaier, Michael},
  isbn         = {978-1-5090-4096-4},
  language     = {eng},
  location     = {Aachen, Germany},
  pages        = {1763--1767},
  publisher    = {IEEE--Institute of Electrical and Electronics Engineers Inc.},
  title        = {Successive Cancellation Decoding of Single Parity-Check Product Codes},
  url          = {http://dx.doi.org/10.1109/ISIT.2017.8006832},
  year         = {2017},
}