IEICE TRANSACTIONS on Communications
Reduced Complexity Belief Propagation Decoding Algorithm for Polar Codes Based on the Principle of Equal Spacing
Summary :
In the log-likelihood ratio (LLR) domain, the belief propagation (BP) decoding algorithm for polar codes incurs high computation complexity due to the computation of the hyperbolic functions in the node update rules. In this paper, we propose a linear approximation method based on the principle of equal spacing to simplify the hyperbolic functions in the BP decoding algorithm. Our method replaces the computation of hyperbolic functions with addition and multiplication operations in the node update rules. Simulation results show that the performance of the modified BP decoding algorithm is almost the same as the original BP decoding algorithm in the low Signal to Noise Ratio (SNR) region, and in the high SNR region the performance of our method is slightly worse. The modified BP decoding algorithm is only implemented with addition and multiplication operations, which greatly reduces computation complexity, and simplifies hardware implementation.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E98-B No.9 pp.1824-1831
- Publication Date
- 2015/09/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E98.B.1824
- Type of Manuscript
- PAPER
- Category
- Fundamental Theories for Communications
Authors
Yinfang HONG
Xidian University
Hui LI
Xidian University
Wenping MA
Xidian University
Xinmei WANG
Xidian University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yinfang HONG, Hui LI, Wenping MA, Xinmei WANG, "Reduced Complexity Belief Propagation Decoding Algorithm for Polar Codes Based on the Principle of Equal Spacing" in IEICE TRANSACTIONS on Communications,
vol. E98-B, no. 9, pp. 1824-1831, September 2015, doi: 10.1587/transcom.E98.B.1824.
Abstract: In the log-likelihood ratio (LLR) domain, the belief propagation (BP) decoding algorithm for polar codes incurs high computation complexity due to the computation of the hyperbolic functions in the node update rules. In this paper, we propose a linear approximation method based on the principle of equal spacing to simplify the hyperbolic functions in the BP decoding algorithm. Our method replaces the computation of hyperbolic functions with addition and multiplication operations in the node update rules. Simulation results show that the performance of the modified BP decoding algorithm is almost the same as the original BP decoding algorithm in the low Signal to Noise Ratio (SNR) region, and in the high SNR region the performance of our method is slightly worse. The modified BP decoding algorithm is only implemented with addition and multiplication operations, which greatly reduces computation complexity, and simplifies hardware implementation.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E98.B.1824/_p
Copy
@ARTICLE{e98-b_9_1824,
author={Yinfang HONG, Hui LI, Wenping MA, Xinmei WANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Reduced Complexity Belief Propagation Decoding Algorithm for Polar Codes Based on the Principle of Equal Spacing},
year={2015},
volume={E98-B},
number={9},
pages={1824-1831},
abstract={In the log-likelihood ratio (LLR) domain, the belief propagation (BP) decoding algorithm for polar codes incurs high computation complexity due to the computation of the hyperbolic functions in the node update rules. In this paper, we propose a linear approximation method based on the principle of equal spacing to simplify the hyperbolic functions in the BP decoding algorithm. Our method replaces the computation of hyperbolic functions with addition and multiplication operations in the node update rules. Simulation results show that the performance of the modified BP decoding algorithm is almost the same as the original BP decoding algorithm in the low Signal to Noise Ratio (SNR) region, and in the high SNR region the performance of our method is slightly worse. The modified BP decoding algorithm is only implemented with addition and multiplication operations, which greatly reduces computation complexity, and simplifies hardware implementation.},
keywords={},
doi={10.1587/transcom.E98.B.1824},
ISSN={1745-1345},
month={September},}
Copy
TY - JOUR
TI - Reduced Complexity Belief Propagation Decoding Algorithm for Polar Codes Based on the Principle of Equal Spacing
T2 - IEICE TRANSACTIONS on Communications
SP - 1824
EP - 1831
AU - Yinfang HONG
AU - Hui LI
AU - Wenping MA
AU - Xinmei WANG
PY - 2015
DO - 10.1587/transcom.E98.B.1824
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E98-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2015
AB - In the log-likelihood ratio (LLR) domain, the belief propagation (BP) decoding algorithm for polar codes incurs high computation complexity due to the computation of the hyperbolic functions in the node update rules. In this paper, we propose a linear approximation method based on the principle of equal spacing to simplify the hyperbolic functions in the BP decoding algorithm. Our method replaces the computation of hyperbolic functions with addition and multiplication operations in the node update rules. Simulation results show that the performance of the modified BP decoding algorithm is almost the same as the original BP decoding algorithm in the low Signal to Noise Ratio (SNR) region, and in the high SNR region the performance of our method is slightly worse. The modified BP decoding algorithm is only implemented with addition and multiplication operations, which greatly reduces computation complexity, and simplifies hardware implementation.
ER -
English
