A new class of parity-check concatenated polar codes using belief propagation decoding

Inseon Kim, Hong Yeop Song

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

Abstract

In this paper, we propose a construction of parity-check equations for Low Density Parity-Check (LDPC) based Parity-Check Concatenated (PCC) polar codes in order to (i) increase the minimum Hamming weight and (ii) correct some errors using belief propagation decoding. We simulate some experiment to show that the proposed LDPC base PCC polar codes have coding gain in the sense of block error rate compared with existing PCC polar codes.

Original languageEnglish
Title of host publication2019 9th International Workshop on Signal Design and its Applications in Communications, IWSDA 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728116693
DOIs
Publication statusPublished - 2019 Oct
Event9th International Workshop on Signal Design and its Applications in Communications, IWSDA 2019 - Dongguan, China
Duration: 2019 Oct 202019 Oct 24

Publication series

Name2019 9th International Workshop on Signal Design and its Applications in Communications, IWSDA 2019

Conference

Conference9th International Workshop on Signal Design and its Applications in Communications, IWSDA 2019
Country/TerritoryChina
CityDongguan
Period19/10/2019/10/24

Bibliographical note

Funding Information:
ACKNOWLEDGMENT This work was supported by Institute for Information & communications Technology Promotion(IITP) grant funded by the Korea government(MSIT) (No.2016-0-00181, Development on the core technologies of transmission, modulation and coding with low-power and low-complexity for massive connectivity in the IoT enviroment)

Publisher Copyright:
© 2019 IEEE.

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Signal Processing

Fingerprint

Dive into the research topics of 'A new class of parity-check concatenated polar codes using belief propagation decoding'. Together they form a unique fingerprint.

Cite this