Home > Research > Publications & Outputs > BCJR trellis construction for binary linear blo...
View graph of relations

BCJR trellis construction for binary linear block codes

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>03/1998
<mark>Journal</mark>IEE Proceedings - Communications
Issue number6
Number of pages5
Pages (from-to)367-371
Publication StatusPublished
<mark>Original language</mark>English


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.