Heuristics for Optimizing in Complexity SISO Trellis-Based Decoding of Linear Block Codes

An important problem in the decoding of linear block codes via the Forward-Backward (FB) algorithm is to find a coordinate permutation that minimizes trellis code complexity. In this paper, heuristics for reducing codes trellises are proposed. We giv e a recapitulating table of the results we have found for many codes and compare them to those published in litterature up to now. This complexity optimization allows us to introduce new schemes of parallel concatenated block codes (PCBC), based on more powerful constituent codes than simple (extended) Hamming codes and to compare their performance with turbo-codes ones.