Optimal threshold sequential decoding algorithms for linear block codes

Optimal threshold sequential decoding algorithms for binary linear block codes which combine the sequential decoding with the threshold decoding are presented. They use the stack algorithm to search through the trellis of the block codes for a path which has the optimal value of the Fano metric function. When a new candidate codeword is found, an optimality check is performed on it by using the Fano-optimal threshold. If checked successfully, the candidate codeword is the most likely (ML) codeword and the search stops. Otherwise the search process continues until either an optimal path is found, which also represents the ML codeword, or the memory buffer of the decoder overflows, in which case the hard decision word is output. Simulation results show that compared with the decoding algorithms available, the proposed decoding algorithms significantly reduce the decoding complexity without losing the decoding performance