TY - JOUR

T1 - BCJR trellis construction for binary linear block codes

AU - Manoukian, H.

AU - Honary, Bahram

PY - 1998/3

Y1 - 1998/3

N2 - A novel low-complexity trellis design technique for linear binary block codes is introduced. It is shown that, for some linear block codes, the problem of finding the 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.

AB - A novel low-complexity trellis design technique for linear binary block codes is introduced. It is shown that, for some linear block codes, the problem of finding the 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.

KW - trellis codes

KW - block codes

KW - matrix algebra

KW - linear codes

KW - computational complexity

KW - decoding

KW - combinatorial mathematics

U2 - 10.1049/ip-com:19971611

DO - 10.1049/ip-com:19971611

M3 - Journal article

VL - 144

SP - 367

EP - 371

JO - IEE Proceedings - Communications

JF - IEE Proceedings - Communications

SN - 1350-2425

IS - 6

ER -