Reduced-complexity belief propagation decoding for polar codes

Jung Hyun Kim, Inseon Kim, Gangsan Kim, Hong-Yeop Song

Research output: Contribution to journalArticle

Abstract

We propose three effective approximate belief propagation decoders for polar codes using Maclaurin's series, piecewise linear function, and stepwise linear function. The proposed decoders have the better perfor-mance than that of existing approximate belief propagation polar decoders, min-sum decoder and normalized min-sum decoder, and almost the same performance with that of original belief propagation decoder. Moreover, the proposed decoders achieve such performance without any optimiza-tion process according to the code parameters and channel condition unlike normalized min-sum decoder, offset min-sum decoder, and their variants.

Original languageEnglish
Pages (from-to)2052-2055
Number of pages4
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE100A
Issue number9
DOIs
Publication statusPublished - 2017 Sep 1

Fingerprint

Belief Propagation
Decoding
Maclaurin series
Piecewise Linear Function
Linear Function

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

@article{a09a3dc15b4747aaadb88e9faaf109db,
title = "Reduced-complexity belief propagation decoding for polar codes",
abstract = "We propose three effective approximate belief propagation decoders for polar codes using Maclaurin's series, piecewise linear function, and stepwise linear function. The proposed decoders have the better perfor-mance than that of existing approximate belief propagation polar decoders, min-sum decoder and normalized min-sum decoder, and almost the same performance with that of original belief propagation decoder. Moreover, the proposed decoders achieve such performance without any optimiza-tion process according to the code parameters and channel condition unlike normalized min-sum decoder, offset min-sum decoder, and their variants.",
author = "Kim, {Jung Hyun} and Inseon Kim and Gangsan Kim and Hong-Yeop Song",
year = "2017",
month = "9",
day = "1",
doi = "10.1587/transfun.E100.A.2052",
language = "English",
volume = "E100A",
pages = "2052--2055",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "9",

}

Reduced-complexity belief propagation decoding for polar codes. / Kim, Jung Hyun; Kim, Inseon; Kim, Gangsan; Song, Hong-Yeop.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E100A, No. 9, 01.09.2017, p. 2052-2055.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Reduced-complexity belief propagation decoding for polar codes

AU - Kim, Jung Hyun

AU - Kim, Inseon

AU - Kim, Gangsan

AU - Song, Hong-Yeop

PY - 2017/9/1

Y1 - 2017/9/1

N2 - We propose three effective approximate belief propagation decoders for polar codes using Maclaurin's series, piecewise linear function, and stepwise linear function. The proposed decoders have the better perfor-mance than that of existing approximate belief propagation polar decoders, min-sum decoder and normalized min-sum decoder, and almost the same performance with that of original belief propagation decoder. Moreover, the proposed decoders achieve such performance without any optimiza-tion process according to the code parameters and channel condition unlike normalized min-sum decoder, offset min-sum decoder, and their variants.

AB - We propose three effective approximate belief propagation decoders for polar codes using Maclaurin's series, piecewise linear function, and stepwise linear function. The proposed decoders have the better perfor-mance than that of existing approximate belief propagation polar decoders, min-sum decoder and normalized min-sum decoder, and almost the same performance with that of original belief propagation decoder. Moreover, the proposed decoders achieve such performance without any optimiza-tion process according to the code parameters and channel condition unlike normalized min-sum decoder, offset min-sum decoder, and their variants.

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

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

U2 - 10.1587/transfun.E100.A.2052

DO - 10.1587/transfun.E100.A.2052

M3 - Article

VL - E100A

SP - 2052

EP - 2055

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 9

ER -