SC-Fano Decoding of Polar Codes

For finite-length polar codes, the standard successive cancellation (SC) decoding has been improved, such as SC-List (SCL), SC-Stack (SCS), and SC-Flip (SCF) decodings. In this paper, we present an alternative improvement of SC decoding by incorporating the Fano sequential decoding into SC decoding. This is referred to as SC-Fano decoding. Specifically, it can address the major drawback of SC decoding by enabling moving-backward when the reliability of an on-going path is not good enough. The SCS and SC-Fano decodings can be viewed as the sequential decoding for polar codes. In addition, for cyclic-redundancy-check (CRC) concatenated polar codes, we enhance SC-Fano decoding by leveraging the bit-flipping idea of SCF decoding. The simulation results demonstrate that the proposed SC-Fano decoding can provide better performance-complexity tradeoff than the existing decoding methods.

[1]  Liang Zhang,et al.  Progressive Bit-Flipping Decoding of Polar Codes over Layered Critical Sets , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[2]  Furkan Ercan,et al.  Improved successive cancellation flip decoding of polar codes based on error distribution , 2018, 2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW).

[3]  Robert Mario Fano,et al.  A heuristic discussion of probabilistic decoding , 1963, IEEE Trans. Inf. Theory.

[4]  David Declercq,et al.  An Improved SCFlip Decoder for Polar Codes , 2016, 2016 IEEE Global Communications Conference (GLOBECOM).

[5]  Furkan Ercan,et al.  Partitioned Successive-Cancellation Flip Decoding of Polar Codes , 2018, 2018 IEEE International Conference on Communications (ICC).

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

[7]  Sae-Young Chung,et al.  Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

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

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

[10]  David Declercq,et al.  Dynamic-SCFlip Decoding of Polar Codes , 2017, IEEE Transactions on Communications.

[11]  Furkan Ercan,et al.  Improved Bit-Flipping Algorithm for Successive Cancellation Decoding of Polar Codes , 2019, IEEE Transactions on Communications.

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

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

[14]  Peter Trifonov,et al.  A Score Function for Sequential Decoding of Polar Codes , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[15]  Vera Miloslavskaya,et al.  Polar codes with dynamic frozen symbols and their decoding by directed search , 2013, 2013 IEEE Information Theory Workshop (ITW).

[16]  Alexios Balatsoukas-Stimming,et al.  A low-complexity improved successive cancellation decoder for polar codes , 2014, 2014 48th Asilomar Conference on Signals, Systems and Computers.

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

[18]  Kai Chen,et al.  Improved Successive Cancellation Decoding of Polar Codes , 2012, IEEE Transactions on Communications.

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