BCJR trellis construction for binary linear block codes

A novel low-complexity trellis design technique for linear binary block codes is introduced. It is shown that, for block codes, the problem of permutation minimal trellis is very simple. For linear binary block codes, a heuristic algorithm for the reduction of trellis complexity is proposed. A reduction in trellis complexity is achieved by the implementation of a new permutation algorithm, which is based on column and row permutations in the minimal weight generator matrix of the code. The `permutation-oriented´ generator matrix for obtaining permutation minimal or near-minimal trellises is defined