Efficient bit-channel reliability computation for multi-mode polar code encoders and decoders

Polar codes are a family of capacity-achieving error-correcting codes, and they have been selected as part of the next generation wireless communication standard. Each polar code bit-channel is assigned a reliability value, used to determine which bits transmit information and which parity. Relative reliabilities need to be known by both encoders and decoders: in case of multi-mode systems, where multiple code lengths and code rates are supported, the storage of relative reliabilities can lead to high implementation complexity. In this work, we observe patterns among code reliabilities, and propose an approximate computation technique to easily represent the reliabilities of multiple codes, through a limited set of variables and update rules. The proposed method allows to tune the trade-off between reliability accuracy and implementation complexity. An approximate computation architecture for encoders and decoders is designed and implemented, showing 50.7% less area occupation than storage-based solutions, with less than 0.05 dB error correction performance degradation. Used within a standard SCL decoder, the proposed architecture results in up to 17.0% less area occupation.

[1]  Warren J. Gross,et al.  Fast Simplified Successive-Cancellation List Decoding of Polar Codes , 2017, 2017 IEEE Wireless Communications and Networking Conference Workshops (WCNCW).

[2]  Alexander Vardy,et al.  How to Construct Polar Codes , 2011, IEEE Transactions on Information Theory.

[3]  Christian Schürch,et al.  A partial order for the synthesized channels of a polar code , 2016, ISIT.

[4]  Warren J. Gross,et al.  A 237 Gbps Unrolled Hardware Polar Decoder , 2014, ArXiv.

[5]  Jun Wang,et al.  Beta-Expansion: A Theoretical Framework for Fast and Recursive Construction of Polar Codes , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[6]  Warren J. Gross,et al.  Simplified Successive-Cancellation List decoding of polar codes , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[7]  Keshab K. Parhi,et al.  Low-Latency Successive-Cancellation List Decoders for Polar Codes With Multibit Decision , 2015, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

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

[9]  Warren J. Gross,et al.  A Fast Polar Code List Decoder Architecture Based on Sphere Decoding , 2016, IEEE Transactions on Circuits and Systems I: Regular Papers.

[10]  Warren J. Gross,et al.  Multi-Mode Unrolled Architectures for Polar Decoders , 2016, IEEE Transactions on Circuits and Systems I: Regular Papers.

[11]  Alexander Vardy,et al.  Flexible and Low-Complexity Encoding and Decoding of Systematic Polar Codes , 2016, IEEE Transactions on Communications.

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

[13]  Zhiyuan Yan,et al.  Symbol-Decision Successive Cancellation List Decoder for Polar Codes , 2015, IEEE Transactions on Signal Processing.

[14]  Alexander Vardy,et al.  Fast Polar Decoders: Algorithm and Implementation , 2013, IEEE Journal on Selected Areas in Communications.

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