Architecture and optimization of high-throughput belief propagation decoding of polar codes

Belief propagation (BP) is one common decoding algorithm for polar codes. BP can be implemented using a forward-backward flooding schedule that removes the data dependency. The intrinsic parallelism of the BP algorithm permits a high throughput. In this paper, we present a parallel BP decoder design space exploration. Through gate-level implementations, we analyze the silicon area, throughput, and power consumption of each design. We present adaptive quantization and early convergence detection to improve the error-correcting performance and throughput of BP decoders.

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

[2]  Keshab K. Parhi,et al.  Architecture optimizations for BP polar decoders , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[3]  Paul H. Siegel,et al.  Enhanced belief propagation decoding of polar codes through concatenation , 2014, 2014 IEEE International Symposium on Information Theory.

[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]  Zhengya Zhang,et al.  A 4.68Gb/s belief propagation polar decoder with bit-splitting register file , 2014, 2014 Symposium on VLSI Circuits Digest of Technical Papers.

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

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

[8]  Alptekin Pamuk,et al.  An FPGA implementation architecture for decoding of polar codes , 2011, 2011 8th International Symposium on Wireless Communication Systems.

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