Successive Cancellation Decoding of Single Parity-Check Product Codes

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

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.

Details

Authors
Organisations
External organisations
  • German Aerospace Center (DLR)
  • Chalmers University of Technology
Research areas and keywords

Subject classification (UKÄ) – MANDATORY

  • Engineering and Technology
  • Electrical Engineering, Electronic Engineering, Information Engineering
Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory (ISIT), 2017
Place of PublicationAachen, Germany
PublisherIEEE--Institute of Electrical and Electronics Engineers Inc.
Pages1763-1767
ISBN (Electronic)978-1-5090-4096-4
StatePublished - 2017 Jun
Publication categoryResearch
Peer-reviewedYes
EventIEEE International Symposium on Information Theory (ISIT), 2017 - Aachen, Germany
Duration: 2017 Jun 252017 Jun 30

Conference

ConferenceIEEE International Symposium on Information Theory (ISIT), 2017
CountryGermany
CityAachen
Period2017/06/252017/06/30

Total downloads

No data available