A Novel D-Metric for Blind Detection of Polar Codes

As a known error-correcting code that has been proved to fully achieve the binary discrete memoryless channel (B-DMC) capacity, polar codes have been considered as a breakthrough in coding theory since its invention. In 2016, polar codes were selected by the 3GPP as the control channel codes for the enhance mobile broadband (eMBB) scenario. The related research of polar codes has been further pushed to the forefront of applications. In spite of the urgent practical needs, research on the algorithm design and efficient implementation of polar codes for control channels and Internet of Things (IoT) is still in infancy. This paper is to combine successful cancellation (SC) and simplified successful cancellation (SSC) decoders to propose a low-complexity algorithm that can realize blind detection of polar codes. Log-likelihood ratios (LLRs) of frozen bits are used to introduce a new metric D, which is to distinguish polar codes of different formats. The realization of blind detection of polar codes can avoid the receiver’s executing complicated decoding algorithm for all polar code candidates, reducing the power, complexity, and delay.

[1]  Sae-Young Chung,et al.  Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

[2]  Tian Xia,et al.  Novel Blind Identification of LDPC Codes Using Average LLR of Syndrome a Posteriori Probability , 2014, IEEE Trans. Signal Process..

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

[4]  Erdal Arikan,et al.  Channel polarization: A method for constructing capacity-achieving codes , 2008, 2008 IEEE International Symposium on Information Theory.

[5]  Peter Trifonov,et al.  Efficient Design and Decoding of Polar Codes , 2012, IEEE Transactions on Communications.

[6]  Zhongwei Si,et al.  Evaluation and Optimization of Gaussian Approximation for Polar Codes , 2015, ArXiv.

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

[8]  Xiaohu You,et al.  An efficient successive cancellation polar decoder based on new folding approaches , 2017, 2017 IEEE 12th International Conference on ASIC (ASICON).

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

[10]  Chuan Zhang,et al.  Energy Consumption of Polar Codes for Wireless Sensor Networks , 2017, WICON.

[11]  Xiaohu You,et al.  Efficient metric sorting schemes for successive cancellation list decoding of polar codes , 2017, 2017 IEEE International Symposium on Circuits and Systems (ISCAS).

[12]  Ivan J. Fair,et al.  Density Evolution for Nonbinary LDPC Codes Under Gaussian Approximation , 2009, IEEE Transactions on Information Theory.

[13]  Alexios Balatsoukas-Stimming,et al.  Blind detection of polar codes , 2017, 2017 IEEE International Workshop on Signal Processing Systems (SiPS).

[14]  Jing Zhou,et al.  Information-Dispersion-Entropy-Based Blind Recognition of Binary BCH Codes in Soft Decision Situations , 2013, Entropy.

[15]  Alexander Vardy,et al.  Fast List Decoders for Polar Codes , 2015, IEEE Journal on Selected Areas in Communications.

[16]  Zhongfeng Wang,et al.  Advanced Baseband Processing Algorithms, Circuits, and Implementations for 5G Communication , 2017, IEEE Journal on Emerging and Selected Topics in Circuits and Systems.