TY - JOUR
T1 - Threshold-Based Fast Successive-Cancellation Decoding of Polar Codes
AU - Zheng, Haotian
AU - Hashemi, Seyyed Ali
AU - Balatsoukas-Stimming, Alexios
AU - Cao, Zizheng
AU - Koonen, Ton
AU - Cioffi, John M.
AU - Goldsmith, Andrea
N1 - Funding Information:
Manuscript received March 20, 2020; revised August 29, 2020, December 13, 2020, and February 13, 2021; accepted February 14, 2021. Date of publication March 9, 2021; date of current version June 16, 2021. This work is supported by NWO Zwaartekracht program on Integrated Nanophotonics; ZJU-TU/e IDEAS project; Open Fund of the State Key Laboratory of Optoelectronic Materials and Technologies (Sun Yat-sen University); Sichuan Science and Technology Program(2020YFH0108). The work of Seyyed Ali Hashemi was supported by the Postdoctoral Fellowship from the Natural Sciences and Engineering Research Council of Canada (NSERC). This article was presented at the IEEE International Conference on Communications, June 2020. The associate editor coordinating the review of this article and approving it for publication was I. Tal. (Corresponding author: Zizheng Cao.) Haotian Zheng, Alexios Balatsoukas-Stimming, Zizheng Cao, and Ton Koonen are with the Department of Electrical Engineering, Eindhoven University of Technology, 5612 AZ Eindhoven, The Netherlands (e-mail: h.zheng@tue.nl; a.k.balatsoukas.stimming@tue.nl; z.cao@tue.nl; a.m.j.koonen@tue.nl).
Publisher Copyright:
© 1972-2012 IEEE.
PY - 2021/6
Y1 - 2021/6
N2 - Fast SC decoding overcomes the latency caused by the serial nature of the SC decoding by identifying new nodes in the upper levels of the SC decoding tree and implementing their fast parallel decoders. In this work, we first present a novel sequence repetition node corresponding to a particular class of bit sequences. Most existing special node types are special cases of the proposed sequence repetition node. Then, a fast parallel decoder is proposed for this class of node. To further speed up the decoding process of general nodes outside this class, a threshold-based hard-decision-aided scheme is introduced. The threshold value that guarantees a given error-correction performance in the proposed scheme is derived theoretically. Analysis and hardware implementation results on a polar code of length 1024 with code rates 1/4, 1/2, and 3/4 show that our proposed algorithm reduces the required clock cycles by up to 8%, and leads to a 10% improvement in the maximum operating frequency compared to state-of-the-art decoders without tangibly altering the error-correction performance. In addition, using the proposed threshold-based hard-decision-aided scheme, the decoding latency can be further reduced by 57% at E b N0 = 5.0$ dB.
AB - Fast SC decoding overcomes the latency caused by the serial nature of the SC decoding by identifying new nodes in the upper levels of the SC decoding tree and implementing their fast parallel decoders. In this work, we first present a novel sequence repetition node corresponding to a particular class of bit sequences. Most existing special node types are special cases of the proposed sequence repetition node. Then, a fast parallel decoder is proposed for this class of node. To further speed up the decoding process of general nodes outside this class, a threshold-based hard-decision-aided scheme is introduced. The threshold value that guarantees a given error-correction performance in the proposed scheme is derived theoretically. Analysis and hardware implementation results on a polar code of length 1024 with code rates 1/4, 1/2, and 3/4 show that our proposed algorithm reduces the required clock cycles by up to 8%, and leads to a 10% improvement in the maximum operating frequency compared to state-of-the-art decoders without tangibly altering the error-correction performance. In addition, using the proposed threshold-based hard-decision-aided scheme, the decoding latency can be further reduced by 57% at E b N0 = 5.0$ dB.
KW - Polar codes
KW - fast successive-cancellation decoding
KW - sequence repetition node
KW - threshold-based hard-decision-aided scheme
UR - http://www.scopus.com/inward/record.url?scp=85102636230&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85102636230&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2021.3064964
DO - 10.1109/TCOMM.2021.3064964
M3 - Article
AN - SCOPUS:85102636230
SN - 0090-6778
VL - 69
SP - 3541
EP - 3555
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 6
M1 - 9373370
ER -