Reduced-Complexity Belief Propagation Decoding for Polar Codes

Jung-Hyun KIM; Inseon KIM; Gangsan KIM; Hong-Yeop SONG

doi:10.1587/transfun.E100.A.2052

Reduced-Complexity Belief Propagation Decoding for Polar Codes

Jung-Hyun KIM, Inseon KIM, Gangsan KIM, Hong-Yeop SONG

Full Text Views

0

Share
Cite this

Summary :

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 performance 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 optimization process according to the code parameters and channel condition unlike normalized min-sum decoder, offset min-sum decoder, and their variants.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.9 pp.2052-2055

Publication Date: 2017/09/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E100.A.2052

Type of Manuscript: LETTER

Category: Coding Theory

Authors

Jung-Hyun KIM
  the Yonsei University
Inseon KIM
  the Yonsei University
Gangsan KIM
  the Yonsei University
Hong-Yeop SONG
  the Yonsei University

Keyword

polar codes, belief propagation decoding, approximation

Cite this

Copy

Jung-Hyun KIM, Inseon KIM, Gangsan KIM, Hong-Yeop SONG, "Reduced-Complexity Belief Propagation Decoding for Polar Codes" in IEICE TRANSACTIONS on Fundamentals, vol. E100-A, no. 9, pp. 2052-2055, September 2017, doi: 10.1587/transfun.E100.A.2052.
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 performance 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 optimization process according to the code parameters and channel condition unlike normalized min-sum decoder, offset min-sum decoder, and their variants.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.2052/_p

Copy

@ARTICLE{e100-a_9_2052,
author={Jung-Hyun KIM, Inseon KIM, Gangsan KIM, Hong-Yeop SONG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Reduced-Complexity Belief Propagation Decoding for Polar Codes},
year={2017},
volume={E100-A},
number={9},
pages={2052-2055},
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 performance 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 optimization process according to the code parameters and channel condition unlike normalized min-sum decoder, offset min-sum decoder, and their variants.},
keywords={},
doi={10.1587/transfun.E100.A.2052},
ISSN={1745-1337},
month={September},}

Copy

TY - JOUR
TI - Reduced-Complexity Belief Propagation Decoding for Polar Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2052
EP - 2055
AU - Jung-Hyun KIM
AU - Inseon KIM
AU - Gangsan KIM
AU - Hong-Yeop SONG
PY - 2017
DO - 10.1587/transfun.E100.A.2052
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2017
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 performance 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 optimization process according to the code parameters and channel condition unlike normalized min-sum decoder, offset min-sum decoder, and their variants.
ER -