Multilevel buckets for sequential decoding of polar codes

The problem of efficient decoding of polar codes is considered. A multilevel bucket structure is proposed for implementation of the stack in the sequential decoding algorithm. This data structure reduces the complexity of stack operations with respect to the implementation based on a red-black tree.

[1]  Kurt Mehlhorn,et al.  Faster algorithms for the shortest path problem , 1990, JACM.

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

[3]  Andrew V. Goldberg,et al.  Buckets, heaps, lists, and monotone priority queues , 1997, SODA '97.

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

[5]  Alexander Vardy,et al.  Hardware Implementation of Successive-Cancellation Decoders for Polar Codes , 2012, J. Signal Process. Syst..

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

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

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