A Simplified Successive-Cancellation Decoder for Polar Codes

A modification is introduced of the successive-cancellation decoder for polar codes, in which local decoders for rate-one constituent codes are simplified. This modification reduces the decoding latency and algorithmic complexity of the conventional decoder, while preserving the bit and block error rate. Significant latency and complexity reductions are achieved over a wide range of code rates.

[1]  Eren Sasoglu,et al.  Polar codes for the two-user binary-input multiple-access channel , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[2]  Emre Telatar,et al.  Polarization for arbitrary discrete memoryless channels , 2009, 2009 IEEE Information Theory Workshop.

[3]  Emre Telatar,et al.  Polar Codes for the m-User MAC and Matroids , 2010, ArXiv.

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

[5]  Alexander Vardy,et al.  Hardware architectures for successive cancellation decoding of polar codes , 2010, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[6]  R. Urbanke,et al.  Polar codes are optimal for lossy source coding , 2009 .

[7]  Rüdiger L. Urbanke,et al.  Polar Codes for Channel and Source Coding , 2009, ArXiv.