Low Complexity Polar Decoder for 5G Embb Control Channel

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.

[1]  Zhongfeng Wang,et al.  A memory efficient belief propagation decoder for polar codes , 2015, China Communications.

[2]  Ye Wang,et al.  Irregular Polar Coding for Massive MIMO Channels , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[3]  Peter Trifonov,et al.  Efficient Design and Decoding of Polar Codes , 2012, IEEE Transactions on Communications.

[4]  Kai Chen,et al.  Polar codes: Primary concepts and practical decoding algorithms , 2014, IEEE Communications Magazine.

[5]  Polina Bayvel,et al.  Irregular Polar Coding for Complexity-Constrained Lightwave Systems , 2018, Journal of Lightwave Technology.

[6]  Li Ping,et al.  Decoding low density parity check codes with finite quantization bits , 2000, IEEE Communications Letters.

[7]  Toshiyuki Tanaka,et al.  Performance of polar codes with the construction using density evolution , 2009, IEEE Communications Letters.

[8]  Rüdiger L. Urbanke,et al.  Polar Codes for Channel and Source Coding , 2009, ArXiv.

[9]  E. Arkan,et al.  A performance comparison of polar codes and Reed-Muller codes , 2008, IEEE Communications Letters.

[10]  Sae-Young Chung,et al.  Gaussian approximation for sum-product decoding of low-density parity-check codes , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[11]  E. Arıkan.  Polar codes : A pipelined implementation , 2010 .

[12]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[13]  Jinhong Yuan,et al.  Low complexity list successive cancellation decoding of polar codes , 2014, IET Commun..

[14]  Qingshuang Zhang,et al.  A simplified belief propagation decoder for polar codes , 2014, 2014 IEEE International Wireless Symposium (IWS 2014).

[15]  Keshab K. Parhi,et al.  Early Stopping Criteria for Energy-Efficient Low-Latency Belief-Propagation Polar Code Decoders , 2014, IEEE Transactions on Signal Processing.

[16]  Alexander Vardy,et al.  List decoding of polar codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[17]  Frank R. Kschischang,et al.  A Simplified Successive-Cancellation Decoder for Polar Codes , 2011, IEEE Communications Letters.

[18]  W. Marsden.  I and J , 2012 .

[19]  Ye Wang,et al.  Irregular Polar Coding for Multi-Level Modulation in Complexity-Constrained Lightwave Systems , 2017, 2017 European Conference on Optical Communication (ECOC).

[20]  Ye Wang,et al.  Turbo Product Codes with Irregular Polar Coding for High-Throughput Parallel Decoding in Wireless OFDM Transmission , 2018, 2018 IEEE International Conference on Communications (ICC).

[21]  Toshiaki Koike-Akino,et al.  Irregular Polar Turbo Product Coding for High-Throughput Optical Interface , 2018, 2018 Optical Fiber Communications Conference and Exposition (OFC).