Termination and tailbiting of rate-k/n direct product convolutional codes

Francesca Vatta, Vladimir Sidorenko, Martin Bossert

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

2 Citations (Scopus)

Abstract

In this paper we extend the algorithms for the termination and tailbiting of direct product convolutional codes, that we proposed in a previous paper, to the rate-k/n case. There, the relationship between the direct product encoder state sequence and the parameters of the vertical and horizontal constituent encoders was derived, and, given a generic information sequence, it was shown how to find the terminating sequence for the direct product encoder of Rate R = 1/n. An algorithm was also proposed for tailbiting rate-1/n direct product convolutional codes. In this paper, we investigate on the tailbiting failure conditions, which were not addressed before, and extend the proposed tailbiting algorithm to the general rate-k/n case.

Original languageEnglish
Title of host publication2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages2023-2027
Number of pages5
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States
Duration: 13 Jun 201018 Jun 2010

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8103

Conference

Conference2010 IEEE International Symposium on Information Theory, ISIT 2010
Country/TerritoryUnited States
CityAustin, TX
Period13/06/1018/06/10

Fingerprint

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

Cite this