Partial sums generation architecture for successive cancellation decoding of polar codes

Polar codes are a new family of error correction codes for which efficient hardware architectures have to be defined for the encoder and the decoder. Polar codes are decoded using the successive cancellation decoding algorithm that includes partial sums computations. We take advantage of the recursive structure of polar codes to introduce an efficient partial sums computation unit that can also implements the encoder. The proposed architecture is synthesized for several code-lengths in 65nm ASIC technology. The area of the resulting design is reduced up to 26% and the maximum working frequency is improved by 25%.

[1]  Frank R. Kschischang,et al.  A Simplified Successive-Cancellation Decoder for Polar Codes , 2011, IEEE Communications Letters.

[2]  Warren J. Gross,et al.  A Semi-Parallel Successive-Cancellation Decoder for Polar Codes , 2013, IEEE Transactions on Signal Processing.

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

[4]  Keshab K. Parhi,et al.  Low-Latency Sequential and Overlapped Architectures for Successive Cancellation Polar Decoder , 2013, IEEE Transactions on Signal Processing.

[5]  Keshab K. Parhi,et al.  Low-Latency SC Decoder Architectures for Polar Codes , 2011, ArXiv.

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

[7]  A. Burg,et al.  A successive cancellation decoder ASIC for a 1024-bit polar code in 180nm CMOS , 2012, 2012 IEEE Asian Solid State Circuits Conference (A-SSCC).

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

[9]  Warren J. Gross,et al.  Increasing the Throughput of Polar Decoders , 2013, IEEE Communications Letters.

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