Reducing complexity of tail-biting trellises
Information Theory
2012-08-27 v1 Systems and Control
math.IT
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.
Cite
@article{arxiv.1202.1336,
title = {Reducing complexity of tail-biting trellises},
author = {Heide Gluesing-Luerssen and G. David Forney,},
journal= {arXiv preprint arXiv:1202.1336},
year = {2012}
}
Comments
5 pages; submitted to the 2012 IEEE International Symposium on Information Theory