A Score Function for Sequential Decoding of Polar Codes

A novel score function is proposed for sequential decoding of polar codes. Significant reduction of the average decoding complexity is achieved by biasing the path metrics in the min-sum version of the stack successive cancellation decoding algorithm with its expected value. The proposed approach can be also used for near-ML decoding of short extended BCH codes.

[1]  James L. Massey.  Variable-length codes and the Fano metric , 1972, IEEE Trans. Inf. Theory.

[2]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[3]  K. Niu,et al.  Stack decoding of polar codes , 2012 .

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

[5]  Vera Miloslavskaya,et al.  Polar Subcodes , 2015, IEEE Journal on Selected Areas in Communications.

[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]  Volker Kühn,et al.  A new code construction for polar codes using min-sum density , 2014, 2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC).

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

[9]  Vera Miloslavskaya,et al.  Sequential Decoding of Polar Codes , 2014, IEEE Communications Letters.

[10]  Rolf Johannesson,et al.  BEAST decoding for block codes , 2004, Eur. Trans. Telecommun..