Low complexity trellis representations of convolutional codes via sectionalization of the minimal trellis.

Saved in:

Bibliographic Details
Title:	Low complexity trellis representations of convolutional codes via sectionalization of the minimal trellis.
Authors:	Benchimol, Isaac¹ ibench@ifam.edu.br, Pimentel, Cecilio² cecilio@ufpe.br, Souza, Richard³ richard@utfpr.edu.br
Source:	Telecommunication Systems. Aug2015, Vol. 59 Issue 4, p491-500. 10p.
Subjects:	Trellis-coded modulation, Coding theory, Computational complexity, Topology, Convolution codes
Abstract:	It has been shown by McEliece and Lin that convolutional codes can be represented by a minimal trellis structure in order to reduce the decoding complexity of the Viterbi algorithm. This trellis module has an irregular structure presenting sections with different number of states. In this paper we present the sectionalization of the minimal trellis module which yields a more compact and regular trellis representation (in terms of maximum number of states and total number of sections) with the same decoding complexity and distance spectrum of the minimal trellis module. We investigate the effects of the trellis sectionalization over the trellis and merge complexity measures. A set of rules are constructed to govern these effects. A list of the most compact sectionalized trellis modules with the same complexities than the minimal module is shown for codes of several rates. We show that various trellis topologies proposed in the literature are specific cases of the sectionalized minimal trellis. [ABSTRACT FROM AUTHOR]
	Copyright of Telecommunication Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	It has been shown by McEliece and Lin that convolutional codes can be represented by a minimal trellis structure in order to reduce the decoding complexity of the Viterbi algorithm. This trellis module has an irregular structure presenting sections with different number of states. In this paper we present the sectionalization of the minimal trellis module which yields a more compact and regular trellis representation (in terms of maximum number of states and total number of sections) with the same decoding complexity and distance spectrum of the minimal trellis module. We investigate the effects of the trellis sectionalization over the trellis and merge complexity measures. A set of rules are constructed to govern these effects. A list of the most compact sectionalized trellis modules with the same complexities than the minimal module is shown for codes of several rates. We show that various trellis topologies proposed in the literature are specific cases of the sectionalized minimal trellis. [ABSTRACT FROM AUTHOR]
ISSN:	10184864
DOI:	10.1007/s11235-014-9909-0