Reducing complexity of tail-biting trellises

Heide Gluesing-Luerssen, G. David Forney

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

2 Scopus citations

Abstract

It is shown that a trellis realization can be locally reduced if it is not state-trim, branch-trim, proper, observable, and controllable. These conditions are not sufficient for local irreducibility. Making use of notions that amount to "almost unobservability/uncontrollability", a necessary and sufficient criterion of local irreducibility for tail-biting trellises is presented.

Original languageEnglish
Title of host publication2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages646-650
Number of pages5
DOIs
StatePublished - 2012
Event2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States
Duration: Jul 1 2012Jul 6 2012

Publication series

NameIEEE International Symposium on Information Theory - Proceedings

Conference

Conference2012 IEEE International Symposium on Information Theory, ISIT 2012
Country/TerritoryUnited States
CityCambridge, MA
Period7/1/127/6/12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Reducing complexity of tail-biting trellises'. Together they form a unique fingerprint.

Cite this