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 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.
Year
DOI
Venue
2017
10.1587/transfun.E100.A.2052
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
Keywords
Field
DocType
polar codes, belief propagation decoding, approximation
Theoretical computer science,Belief propagation decoding,Polar,List decoding,Mathematics
Journal
Volume
Issue
ISSN
E100A
9
1745-1337
Citations 
PageRank 
References 
0
0.34
5
Authors
4
Name
Order
Citations
PageRank
Jung-hyun Kim15414.07
inseon kim201.69
Gangsan Kim324.43
Hong-Yeop Song432951.84