ML Soft-decision Decoding for Binary Linear Block Codes Based on Trellises of Their Supercodes

Based on the notion of supercodes, we propose a two-phase maximum-likelihood (ML) soft-decision decoding (tpMLSD) algorithm for binary linear block codes in this work. The first phase applies the priority-first search algorithm backwardly to a trellis derived from the parity-check matrix of the supercode of the linear block code. Using the information retained from the first phase, the second phase employs the priority-first search algorithm to the trellis corresponding to the linear block code itself, which guarantees to find the ML decision with a constant complexity per information bit at high signal-to-noise ratios (SNRs). Simulations on the extended BCH code of n = 64 and k = 24 show that the proposed two-phase scheme is an order of magnitude more efficient in average decoding complexity than the recursive ML decoding [1] when the SNR per information bit is 8 dB.

[1]  Yvon Savaria,et al.  A systolic architecture for fast stack sequential decoders , 1994, IEEE Trans. Commun..

[2]  Jack K. Wolf,et al.  Efficient maximum likelihood decoding of linear block codes using a trellis , 1978, IEEE Trans. Inf. Theory.

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

[4]  Tadao Kasami,et al.  A Trellis-Based Recursive Maximum-Likelihood Decoding Algorithm for Binary Linear Block Codes , 1998, IEEE Trans. Inf. Theory.

[5]  Jakov Snyders,et al.  Reduced lists of error patterns for maximum likelihood soft decoding , 1991, IEEE Trans. Inf. Theory.

[6]  Yunghsiang Sam Han,et al.  Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes , 1993, IEEE Trans. Inf. Theory.

[7]  Patrick G. Farrell,et al.  On Hybrid Stack Decoding Algorithms for Block Codes , 1998, IEEE Trans. Inf. Theory.

[8]  Hung-Ta Pai,et al.  Priority-first search decoding for convolutional tail-biting codes , 2008, 2008 International Symposium on Information Theory and Its Applications.

[9]  Carlo Fischione,et al.  Low-Latency Networking: Where Latency Lurks and How to Tame It , 2018, Proceedings of the IEEE.

[10]  Patrick A. H. Bours,et al.  On maximum likelihood soft-decision decoding of binary linear codes , 1993, IEEE Trans. Inf. Theory.

[11]  Jakov Snyders,et al.  Reliability-based code-search algorithms for maximum-likelihood decoding of block codes , 1997, IEEE Trans. Inf. Theory.

[12]  B. Sundar Rajan,et al.  Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises , 2006, ArXiv.

[13]  Daniel J. Costello,et al.  Supercode heuristics for tree search decoding , 2008, 2008 IEEE Information Theory Workshop.

[14]  Toru Fujiwara,et al.  Adaptive recursive MLD using ordered statistics for low rate codes , 2010, 2010 International Symposium On Information Theory & Its Applications.

[15]  Yunghsiang Sam Han.  A New Treatment of Priority-First Search Maximum-Likelihood Soft-Decision Decoding of Linear Block Codes , 1998, IEEE Trans. Inf. Theory.

[16]  Shigeichi Hirasawa,et al.  An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder , 1994, IEEE Trans. Inf. Theory.

[17]  Pramod K. Varshney,et al.  A Low-Complexity Maximum-Likelihood Decoder for Tail-Biting Convolutional Codes , 2018, IEEE Transactions on Communications.

[18]  Shigeichi Hirasawa,et al.  An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding , 1997, IEEE Trans. Inf. Theory.

[19]  Yunghsiang Sam Han,et al.  Low-complexity ML decoding for convolutional tail-biting codes , 2008, IEEE Communications Letters.