On the Tradeoff Between Accuracy and Complexity in Blind Detection of Polar Codes

Polar codes are a recent family of error-correcting codes with a number of desirable characteristics. Their disruptive nature is illustrated by their rapid adoption in the 5th-generation mobile-communication standard, where they are used to protect control messages. In this work, we describe a two-stage system tasked with identifying the location of control messages that consists of a detection and selection stage followed by a decoding one. The first stage spurs the need for polar-code detection algorithms with variable effort to balance complexity between the two stages. We illustrate this idea of variable effort for multiple detection algorithms aimed at the first stage. We propose three novel blind detection methods based on belief-propagation decoding inspired by early-stopping criteria. Then we show how their reliability improves with the number of decoding iterations to highlight the possible tradeoffs between accuracy and complexity. Additionally, we show similar tradeoffs for a detection method from previous work. In a setup where only one block encoded with the polar code of interest is present among many other blocks, our results notably show that, depending on the complexity budget, a variable number of undesirable blocks can be dismissed while achieving a missed-detection rate in line with the block-error rate of a complex decoding algorithm.

[1]  Aijun Liu,et al.  Early stopping criterion for belief propagation polar decoder based on frozen bits , 2017 .

[2]  Jean-Pierre Tillich,et al.  Recovering the interleaver of an unknown turbo-code , 2014, 2014 IEEE International Symposium on Information Theory.

[3]  Christophe Chabot.  Recognition of a code in a noisy environment , 2007, 2007 IEEE International Symposium on Information Theory.

[4]  Xiaohu You,et al.  Efficient early termination schemes for belief-propagation decoding of polar codes , 2015, 2015 IEEE 11th International Conference on ASIC (ASICON).

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

[6]  Alexios Balatsoukas-Stimming,et al.  On the Computational Complexity of Blind Detection of Binary Linear Codes , 2018, 2019 IEEE International Symposium on Information Theory (ISIT).

[7]  Furkan Ercan,et al.  Design and Implementation of a Polar Codes Blind Detection Scheme , 2018, IEEE Transactions on Circuits and Systems II: Express Briefs.

[8]  Kadir Türk,et al.  Simplified Early Stopping Criterion for Belief-Propagation Polar Code Decoders , 2016, IEEE Communications Letters.

[9]  Warren J. Gross,et al.  Blind Detection With Polar Codes , 2017, IEEE Communications Letters.

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

[11]  Antoine Valembois,et al.  Detection and recognition of a binary linear code , 2001, Discret. Appl. Math..

[12]  Hong Jiang,et al.  Novel Blind Encoder Parameter Estimation for Turbo Codes , 2012, IEEE Communications Letters.

[13]  Keshab K. Parhi,et al.  Early Stopping Criteria for Energy-Efficient Low-Latency Belief-Propagation Polar Code Decoders , 2014, 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]  Chi-Ying Tsui,et al.  Low complexity belief propagation polar code decoder , 2015, 2015 IEEE Workshop on Signal Processing Systems (SiPS).

[16]  Huang-Chang Lee,et al.  Early termination belief propagation decoder with parity check matrix for polar codes , 2018, 2018 27th Wireless and Optical Communication Conference (WOCC).

[17]  Jing Li,et al.  On Blind Recognition of Channel Codes Within a Candidate Set , 2016, IEEE Communications Letters.

[18]  Arti D. Yardi,et al.  Channel-code detection by a third-party receiver via the likelihood ratio test , 2014, 2014 IEEE International Symposium on Information Theory.

[19]  Matthieu Finiasz,et al.  Reconstruction of punctured convolutional codes , 2009, 2009 IEEE Information Theory Workshop.

[20]  Erik G. Larsson,et al.  A Fast Scheme for Blind Identification of Channel Codes , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.