Termination and tailbiting of direct product convolutional codes

Francesca Vatta, Andrea Schiavi, Vladimir Sidorenko, Martin Bossert

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Citations (Scopus)

Abstract

In this paper we propose some algorithms for the termination and tailbiting of direct product convolutional codes, whose definition was given in a previous paper by M. Bossert, C. Medina, and V. Sidorenko. There, the properties of these codes were investigated analyzing their generator and parity check matrices. We assume to encode these codes by feedback convolutional encoders realized in controller canonical form. The relationship between the direct product encoder state sequence and the parameters of the vertical and horizontal constituent encoders is derived first. Afterwards, given a generic information sequence, it is shown how to find the terminating sequence for the direct product encoder and an algorithm is also proposed for tailbiting, i.e., for finding the encoder starting state such that the encoder, after being fed with the information sequence, ends in the same state where it started from.

Original languageEnglish
Title of host publication2009 IEEE Information Theory Workshop, ITW 2009
Pages213-217
Number of pages5
DOIs
Publication statusPublished - 7 Dec 2009
Externally publishedYes
Event2009 IEEE Information Theory Workshop, ITW 2009 - Taormina, Sicily, Italy
Duration: 11 Oct 200916 Oct 2009

Publication series

Name2009 IEEE Information Theory Workshop, ITW 2009

Conference

Conference2009 IEEE Information Theory Workshop, ITW 2009
Country/TerritoryItaly
CityTaormina, Sicily
Period11/10/0916/10/09

Fingerprint

Dive into the research topics of 'Termination and tailbiting of direct product convolutional codes'. Together they form a unique fingerprint.

Cite this