Error Detection Strategies for CRC-Concatenated Polar Codes under Successive Cancellation List Decoding

In this work we introduce a framework to study the trade-off between the undetected error rate (UER) and overall frame error rate (FER) of CRC-concatenated polar codes in the short blocklength regime. Three approaches to improve the tradeoff under successive cancellation list (SCL) decoding are outlined. Two techniques are based on the optimum threshold test introduced by Forney in 1968, whereas a third technique partitions the CRC code parity bits in two sets, where one set is used to prune the SCL decoder list, and the other set is used for error detection. The performance of the three schemes is analyzed via Monte Carlo simulations, and compared with a finite-length achievability bound based on Forney's random coding bound.

[1]  Alexander M. Baldauf,et al.  Efficient Computation of Viterbi Decoder Reliability With an Application to Variable-Length Coding , 2022, IEEE Transactions on Communications.

[2]  Kyeongcheol Yang,et al.  Improving the Tradeoff Between Error Correction and Detection of Concatenated Polar Codes , 2021, IEEE Transactions on Communications.

[3]  William E. Ryan,et al.  Efficient Error-Correcting Codes in the Short Blocklength Regime , 2018, Phys. Commun..

[4]  Osvaldo Simeone,et al.  Reliable Transmission of Short Packets Through Queues and Noisy Channels Under Latency and Peak-Age Violation Guarantees , 2018, IEEE Journal on Selected Areas in Communications.

[5]  Petar Popovski,et al.  Towards Massive, Ultra-Reliable, and Low-Latency Wireless Communication with Short Packets , 2015 .

[6]  Richard D. Wesel,et al.  Reliability-Output Decoding of Tail-Biting Convolutional Codes , 2013, IEEE Transactions on Communications.

[7]  Vera Miloslavskaya,et al.  Polar codes with dynamic frozen symbols and their decoding by directed search , 2013, 2013 IEEE Information Theory Workshop (ITW).

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

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

[10]  Tomaso de Cola,et al.  Reliability Options for Data Communications in the Future Deep-Space Missions , 2011, Proceedings of the IEEE.

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

[12]  Shlomo Shamai,et al.  Performance Bounds for Erasure, List, and Decision Feedback Schemes With Linear Block Codes , 2010, IEEE Transactions on Information Theory.

[13]  S. Verdú,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[14]  Toshiyuki Tanaka,et al.  Performance of polar codes with the construction using density evolution , 2009, IEEE Communications Letters.

[15]  S. Dolinar,et al.  Bounded angle iterative decoding of LDPC codes , 2008, MILCOM 2008 - 2008 IEEE Military Communications Conference.

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

[17]  Dariush Divsalar,et al.  The limits of coding with joint constraints on detected and undetected error rates , 2008, 2008 IEEE International Symposium on Information Theory.

[18]  Norbert Stolte,et al.  Rekursive Codes mit der Plotkin-Konstruktion und ihre Decodierung , 2002 .

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

[20]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[21]  Carl W. Baum,et al.  A Reliability Output Viterbi Algorithm with Applications to Hybrid ARQ , 1998, IEEE Trans. Inf. Theory.

[22]  G. David Forney,et al.  Exponential error bounds for erasure, list, and decision feedback schemes , 1968, IEEE Trans. Inf. Theory.

[23]  Shlomo Shamai,et al.  On Optimal Erasure and List Decoding Schemes of Convolutional Codes , 2009 .

[24]  R. Blahut Algebraic Codes for Data Transmission: Dedication , 2002 .