IEICE TRANSACTIONS on Fundamentals
Reduced Complexity Successive-Cancellation Decoding of Polar Codes Based on Linear Approximation
Summary :
In this letter, the principle of LLR-based successive-cancellation (SC) polar decoding algorithm is explored. In order to simplify the logarithm and exponential operations in the updating rules for polar codes, we further utilize a piece-wise linear algorithm to approximate the transcendental functions, where the piece-wise linear algorithm only consists of multiplication and addition operations. It is demonstrated that with one properly allowable maximum error δ chosen for success-failure algorithm, performances approach to that of the standard SC algorithm can be achieved. Besides, the complexity reduction is realized by calculating a linear function instead of nonlinear function. Simulation results show that our proposed piece-wise SC decoder greatly reduces the complexity of the SC-based decoders with no loss in error correcting performance.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E103-A No.8 pp.995-999
- Publication Date
- 2020/08/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2019EAL2098
- Type of Manuscript
- LETTER
- Category
- Information Theory
Authors
Yongli YAN
Institute of Microelectronics of Chinese Academy of Sciences,University of Chinese Academy of Sciences
Xuanxuan ZHANG
Institute of Microelectronics of Chinese Academy of Sciences,University of Chinese Academy of Sciences
Bin WU
Institute of Microelectronics of Chinese Academy of Sciences
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
Yongli YAN, Xuanxuan ZHANG, Bin WU, "Reduced Complexity Successive-Cancellation Decoding of Polar Codes Based on Linear Approximation" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 8, pp. 995-999, August 2020, doi: 10.1587/transfun.2019EAL2098.
Abstract: In this letter, the principle of LLR-based successive-cancellation (SC) polar decoding algorithm is explored. In order to simplify the logarithm and exponential operations in the updating rules for polar codes, we further utilize a piece-wise linear algorithm to approximate the transcendental functions, where the piece-wise linear algorithm only consists of multiplication and addition operations. It is demonstrated that with one properly allowable maximum error δ chosen for success-failure algorithm, performances approach to that of the standard SC algorithm can be achieved. Besides, the complexity reduction is realized by calculating a linear function instead of nonlinear function. Simulation results show that our proposed piece-wise SC decoder greatly reduces the complexity of the SC-based decoders with no loss in error correcting performance.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2019EAL2098/_p
Copy
@ARTICLE{e103-a_8_995,
author={Yongli YAN, Xuanxuan ZHANG, Bin WU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Reduced Complexity Successive-Cancellation Decoding of Polar Codes Based on Linear Approximation},
year={2020},
volume={E103-A},
number={8},
pages={995-999},
abstract={In this letter, the principle of LLR-based successive-cancellation (SC) polar decoding algorithm is explored. In order to simplify the logarithm and exponential operations in the updating rules for polar codes, we further utilize a piece-wise linear algorithm to approximate the transcendental functions, where the piece-wise linear algorithm only consists of multiplication and addition operations. It is demonstrated that with one properly allowable maximum error δ chosen for success-failure algorithm, performances approach to that of the standard SC algorithm can be achieved. Besides, the complexity reduction is realized by calculating a linear function instead of nonlinear function. Simulation results show that our proposed piece-wise SC decoder greatly reduces the complexity of the SC-based decoders with no loss in error correcting performance.},
keywords={},
doi={10.1587/transfun.2019EAL2098},
ISSN={1745-1337},
month={August},}
Copy
TY - JOUR
TI - Reduced Complexity Successive-Cancellation Decoding of Polar Codes Based on Linear Approximation
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 995
EP - 999
AU - Yongli YAN
AU - Xuanxuan ZHANG
AU - Bin WU
PY - 2020
DO - 10.1587/transfun.2019EAL2098
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2020
AB - In this letter, the principle of LLR-based successive-cancellation (SC) polar decoding algorithm is explored. In order to simplify the logarithm and exponential operations in the updating rules for polar codes, we further utilize a piece-wise linear algorithm to approximate the transcendental functions, where the piece-wise linear algorithm only consists of multiplication and addition operations. It is demonstrated that with one properly allowable maximum error δ chosen for success-failure algorithm, performances approach to that of the standard SC algorithm can be achieved. Besides, the complexity reduction is realized by calculating a linear function instead of nonlinear function. Simulation results show that our proposed piece-wise SC decoder greatly reduces the complexity of the SC-based decoders with no loss in error correcting performance.
ER -
English
