Low Complexity Polar Decoder for 5G Embb Control Channel

Ce Sun; Zesong Fei; Congzhe Cao; Xinyi Wang; Dai Jia

doi:10.1109/ACCESS.2019.2910535

Low Complexity Polar Decoder for 5G Embb Control Channel

Ce Sun, Zesong Fei^*, Congzhe Cao, Xinyi Wang, Dai Jia

^*Corresponding author for this work

School of Information and Electronics

Research output: Contribution to journal › Article › peer-review

10 Citations (Scopus)

Abstract

Polar codes have become the channel coding scheme for control channel of enhanced mobile broadband in the fifth generation (5G) communication systems. Belief propagation (BP) decoding of polar codes has the advantage of low decoding latency and high parallelism but suffers from high complexity. In this paper, a low complexity BP decoder is proposed for polar codes. We reduce the computational complexity by two steps. First, the cyclic redundancy check is concatenated to the decoder in order to decrease the number iterations of the BP algorithm. Then, a threshold is proposed based on Gaussian approximation to save the computational complexity of BP nodes. If the log-likelihood ratio of a node in the tanner graph is larger than the threshold, this node is no longer updated during the rest of the decoding process. The simulation results show that the proposed scheme has a similar block error rate performance with the original BP decoder, while the computational complexity is reduced significantly.

Original language	English
Article number	8688403
Pages (from-to)	50710-50717
Number of pages	8
Journal	IEEE Access
Volume	7
DOIs	https://doi.org/10.1109/ACCESS.2019.2910535
Publication status	Published - 2019

Keywords

Polar codes
belief propagation
eMBB
low complexity decoding

Access to Document

10.1109/ACCESS.2019.2910535

Cite this

@article{807ef243373b403187ed9d6ed316cdb4,

title = "Low Complexity Polar Decoder for 5G Embb Control Channel",

abstract = "Polar codes have become the channel coding scheme for control channel of enhanced mobile broadband in the fifth generation (5G) communication systems. Belief propagation (BP) decoding of polar codes has the advantage of low decoding latency and high parallelism but suffers from high complexity. In this paper, a low complexity BP decoder is proposed for polar codes. We reduce the computational complexity by two steps. First, the cyclic redundancy check is concatenated to the decoder in order to decrease the number iterations of the BP algorithm. Then, a threshold is proposed based on Gaussian approximation to save the computational complexity of BP nodes. If the log-likelihood ratio of a node in the tanner graph is larger than the threshold, this node is no longer updated during the rest of the decoding process. The simulation results show that the proposed scheme has a similar block error rate performance with the original BP decoder, while the computational complexity is reduced significantly.",

keywords = "Polar codes, belief propagation, eMBB, low complexity decoding",

author = "Ce Sun and Zesong Fei and Congzhe Cao and Xinyi Wang and Dai Jia",

note = "Publisher Copyright: {\textcopyright} 2013 IEEE.",

year = "2019",

doi = "10.1109/ACCESS.2019.2910535",

language = "English",

volume = "7",

pages = "50710--50717",

journal = "IEEE Access",

issn = "2169-3536",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Low Complexity Polar Decoder for 5G Embb Control Channel

AU - Sun, Ce

AU - Fei, Zesong

AU - Cao, Congzhe

AU - Wang, Xinyi

AU - Jia, Dai

PY - 2019

Y1 - 2019

N2 - Polar codes have become the channel coding scheme for control channel of enhanced mobile broadband in the fifth generation (5G) communication systems. Belief propagation (BP) decoding of polar codes has the advantage of low decoding latency and high parallelism but suffers from high complexity. In this paper, a low complexity BP decoder is proposed for polar codes. We reduce the computational complexity by two steps. First, the cyclic redundancy check is concatenated to the decoder in order to decrease the number iterations of the BP algorithm. Then, a threshold is proposed based on Gaussian approximation to save the computational complexity of BP nodes. If the log-likelihood ratio of a node in the tanner graph is larger than the threshold, this node is no longer updated during the rest of the decoding process. The simulation results show that the proposed scheme has a similar block error rate performance with the original BP decoder, while the computational complexity is reduced significantly.

AB - Polar codes have become the channel coding scheme for control channel of enhanced mobile broadband in the fifth generation (5G) communication systems. Belief propagation (BP) decoding of polar codes has the advantage of low decoding latency and high parallelism but suffers from high complexity. In this paper, a low complexity BP decoder is proposed for polar codes. We reduce the computational complexity by two steps. First, the cyclic redundancy check is concatenated to the decoder in order to decrease the number iterations of the BP algorithm. Then, a threshold is proposed based on Gaussian approximation to save the computational complexity of BP nodes. If the log-likelihood ratio of a node in the tanner graph is larger than the threshold, this node is no longer updated during the rest of the decoding process. The simulation results show that the proposed scheme has a similar block error rate performance with the original BP decoder, while the computational complexity is reduced significantly.

KW - Polar codes

KW - belief propagation

KW - eMBB

KW - low complexity decoding

UR - http://www.scopus.com/inward/record.url?scp=85065118148&partnerID=8YFLogxK

U2 - 10.1109/ACCESS.2019.2910535

DO - 10.1109/ACCESS.2019.2910535

M3 - Article

AN - SCOPUS:85065118148

SN - 2169-3536

VL - 7

SP - 50710

EP - 50717

JO - IEEE Access

JF - IEEE Access

M1 - 8688403

ER -

Low Complexity Polar Decoder for 5G Embb Control Channel

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this