Reducing complexity of tail-biting trellises

Heide Gluesing-Luerssen; G. David Forney

doi:10.1109/ISIT.2012.6284281

Reducing complexity of tail-biting trellises

Heide Gluesing-Luerssen, G. David Forney

Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages	646-650
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2012.6284281
State	Published - 2012
Event	2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States Duration: Jul 1 2012 → Jul 6 2012

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8105

Conference

Conference	2012 IEEE International Symposium on Information Theory, ISIT 2012
Country/Territory	United States
City	Cambridge, MA
Period	7/1/12 → 7/6/12

Funding

Funders	Funder number
Directorate for Mathematical and Physical Sciences	0908379

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2012.6284281

Cite this

@inproceedings{f405d8557b28460e8fa594d5b738c690,

title = "Reducing complexity of tail-biting trellises",

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.",

author = "Heide Gluesing-Luerssen and Forney, {G. David}",

year = "2012",

doi = "10.1109/ISIT.2012.6284281",

language = "English",

isbn = "9781467325790",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "646--650",

booktitle = "2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012",

note = "2012 IEEE International Symposium on Information Theory, ISIT 2012 ; Conference date: 01-07-2012 Through 06-07-2012",

}

Gluesing-Luerssen, H & Forney, GD 2012, Reducing complexity of tail-biting trellises. in 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012., 6284281, IEEE International Symposium on Information Theory - Proceedings, pp. 646-650, 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, United States, 7/1/12. https://doi.org/10.1109/ISIT.2012.6284281

TY - GEN

T1 - Reducing complexity of tail-biting trellises

AU - Gluesing-Luerssen, Heide

AU - Forney, G. David

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84867521313&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867521313&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2012.6284281

DO - 10.1109/ISIT.2012.6284281

M3 - Conference contribution

AN - SCOPUS:84867521313

SN - 9781467325790

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 646

EP - 650

BT - 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012

T2 - 2012 IEEE International Symposium on Information Theory, ISIT 2012

Y2 - 1 July 2012 through 6 July 2012

ER -

Reducing complexity of tail-biting trellises

Abstract

Publication series

Conference

Funding

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this