A comparison of trellis modules for binary convolutional codes

Author

Hole, Kjell Jørgen

Author_Institution

Dept. of Inf., Bergen Univ., Norway

Volume

46

Issue

10

fYear

1998

fDate

10/1/1998 12:00:00 AM

Firstpage

1245

Lastpage

1249

Abstract

A convolutional code can be represented by the conventional trellis module or the “minimal” trellis module based on the BCJR trellis for block codes. For many convolutional codes, the trellis complexity (TC) of the minimal module is significantly less than the TC of the conventional module. An alternative representation, consisting of an extended BCJR trellis module and a pruned version of the conventional module, was previously introduced. We prove that the overall TC of the two new modules is less than the TC of the conventional module for infinitely many codes. Furthermore, we show that the overall TC of the new modules is smaller than the TC of the minimal module for many codes considered in the literature

Keywords

block codes; computational complexity; convolutional codes; trellis codes; BCJR trellis; BCJR trellis module; binary convolutional codes; block codes; conventional module; minimal module; minimal trellis module; module pruned version; representation; trellis complexity; trellis modules; AWGN; Additive white noise; Block codes; Communications Society; Convolutional codes; Councils; Informatics; Maximum likelihood decoding; Parity check codes; Viterbi algorithm;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.725298

Filename

725298