Sphere decoder for polar codes concatenated with cyclic redundancy check

The existing cyclic redundancy check (CRC)-aided successive cancellation list (CA-SCL) decoder partitions the decoding process into two steps, where an SCL is followed by a CRC check. An SCL decoder can approach the maximum-likelihood (ML) decoding performance of the inner polar codes using a sufficiently large list; however, in this case, CRC is only used for performing error detection. Therefore, the decoding performance of the outer CRC is different from that of ML because the errors are not rectified, which degrades the performance of the entire concatenated codes. In this study, we propose a sphere decoder (SD) that can achieve the ML performance of polar codes concatenated with CRC to address the suboptimality of CA-SCL decoding. The proposed SD performs joint decoding of the CRC-polar codes in a single step, thereby avoiding the polar decoding and CRC detection decoding scheme. Because the proposed SD guarantees the ML decoding performance of the CRC-polar concatenated codes, the simulation results demonstrate that the block error rate (BLER) of the proposed SD acts as the lower bound of the CA-SCL decoding performance. Further, a new initial radius selection method is proposed for the SD to reduce the average decoding complexity. The simulations demonstrate that the proposed initial radius selection method reduces more amount of decoding complexity when compared with that reduced using sequential step size methods.

[1]  Warren J. Gross,et al.  Matrix reordering for efficient list sphere decoding of polar codes , 2016, 2016 IEEE International Symposium on Circuits and Systems (ISCAS).

[2]  William Ryan,et al.  Channel Codes by William Ryan , 2009 .

[3]  Kai Chen,et al.  CRC-Aided Decoding of Polar Codes , 2012, IEEE Communications Letters.

[4]  Alexios Balatsoukas-Stimming,et al.  LLR-Based Successive Cancellation List Decoding of Polar Codes , 2013, IEEE Transactions on Signal Processing.

[5]  Warren J. Gross,et al.  List sphere decoding of polar codes , 2015, 2015 49th Asilomar Conference on Signals, Systems and Computers.

[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]  Jing Guo,et al.  Efficient sphere decoding of polar codes , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

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

[9]  Georgios B. Giannakis,et al.  Sphere decoding algorithms with improved radius search , 2004, IEEE Transactions on Communications.

[10]  Philip Koopman,et al.  Cyclic redundancy code (CRC) polynomial selection for embedded networks , 2004, International Conference on Dependable Systems and Networks, 2004.

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

[12]  Konstantinos Nikitopoulos,et al.  Reduced Latency ML Polar Decoding via Multiple Sphere-Decoding Tree Searches , 2018, IEEE Transactions on Vehicular Technology.

[13]  Jun Wang,et al.  Beta-Expansion: A Theoretical Framework for Fast and Recursive Construction of Polar Codes , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[14]  Markus Rupp,et al.  BER comparison between Convolutional, Turbo, LDPC, and Polar codes , 2017, 2017 24th International Conference on Telecommunications (ICT).

[15]  Kai Chen,et al.  Low-Complexity Sphere Decoding of Polar Codes Based on Optimum Path Metric , 2013, IEEE Communications Letters.

[16]  William Ryan,et al.  Channel Codes: Classical and Modern , 2009 .

[17]  Babak Hassibi,et al.  On the sphere-decoding algorithm I. Expected complexity , 2005, IEEE Transactions on Signal Processing.

[18]  Peter Kazakov,et al.  Fast calculation of the number of minimum-weight words of CRC codes , 2000, IEEE Trans. Inf. Theory.

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

[20]  Shu Lin,et al.  Channel Codes: Classical and Modern , 2009 .

[21]  Martin Herrmann,et al.  Optimization of cyclic redundancy-check codes with 24 and 32 parity bits , 1993, IEEE Trans. Commun..

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

[23]  Alexander Vardy,et al.  Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.

[24]  Xiaohu You,et al.  A complexity-reduced fast successive cancellation list decoder for polar codes , 2018, Science China Information Sciences.

[25]  Mehmet Ertugrul Çelebi,et al.  Code based efficient maximum-likelihood decoding of short polar codes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[26]  Aijun Liu,et al.  CRC Code Design for List Decoding of Polar Codes , 2017, IEEE Communications Letters.

[27]  Babak Hassibi,et al.  On the sphere-decoding algorithm II. Generalizations, second-order statistics, and applications to communications , 2005, IEEE Transactions on Signal Processing.