Reduced-Complexity Belief Propagation Decoding for Polar Codes

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

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E100-A    No.9    pp.2052-2055
Publication Date: 2017/09/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E100.A.2052
Type of Manuscript: LETTER
Category: Coding Theory
polar codes,  belief propagation decoding,  approximation,  

Full Text: PDF(565.1KB)>>
Buy this Article

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.