Combining belief propagation and successive cancellation list decoding of polar codes on a GPU platform

The decoding performance of polar codes strongly depends on the decoding algorithm used, while also the decoder throughput and its latency mainly depend on the decoding algorithm. In this work, we implement the powerful successive cancellation list (SCL) decoder on a GPU and identify the bottlenecks of this algorithm with respect to parallel computing and its difficulties. The inherent serial decoding property of the SCL algorithm naturally limits the achievable speed-up gains on GPUs when compared to CPU implementations. In order to increase the decoding throughput, we use a hybrid decoding scheme based on the belief propagation (BP) decoder, which can be intra- and inter-frame parallelized. The proposed scheme combines excellent decoding performance and high throughput within the signal-to-noise ratio (SNR) region of interest.

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

[2]  Alexander Vardy,et al.  How to Construct Polar Codes , 2011, IEEE Transactions on Information Theory.

[3]  Keshab K. Parhi,et al.  Algorithm and architecture for hybrid decoding of polar codes , 2014, 2014 48th Asilomar Conference on Signals, Systems and Computers.

[4]  Leonel Sousa,et al.  Massively LDPC Decoding on Multicore Architectures , 2011, IEEE Transactions on Parallel and Distributed Systems.

[5]  Warren J. Gross,et al.  Low-Latency Software Polar Decoders , 2015, J. Signal Process. Syst..

[6]  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.

[7]  Michael Lentmaier,et al.  Challenges and some new directions in channel coding , 2015, Journal of Communications and Networks.

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

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

[10]  Gerhard Fettweis,et al.  Benefits and challenges of virtualization in 5G radio access networks , 2015, IEEE Communications Magazine.

[11]  Norbert Luttenberger,et al.  Fast in‐place, comparison‐based sorting with CUDA: a study with bitonic sort , 2011, Concurr. Comput. Pract. Exp..

[12]  Zhengya Zhang,et al.  A 4.68Gb/s belief propagation polar decoder with bit-splitting register file , 2014, 2014 Symposium on VLSI Circuits Digest of Technical Papers.

[13]  B. Achiriloaie,et al.  VI REFERENCES , 1961 .

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

[15]  Kai Chen,et al.  A Decision-Aided Parallel SC-List Decoder for Polar Codes , 2015, ArXiv.

[16]  Bin Li,et al.  An Adaptive Successive Cancellation List Decoder for Polar Codes with Cyclic Redundancy Check , 2012, IEEE Communications Letters.

[17]  Nitin Chandrachoodan,et al.  A GPU implementation of belief propagation decoder for polar codes , 2012, 2012 Conference Record of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

[18]  Navid Nikaein,et al.  Processing Radio Access Network Functions in the Cloud: Critical Issues and Modeling , 2015, MCS '15.