Unique Factorization and Controllability of Tail-Biting Trellis Realizations via Controller Granule Decompositions
Information Theory
2015-02-24 v1 Systems and Control
math.IT
Abstract
The Conti-Boston factorization theorem (CBFT) for linear tail-biting trellis realizations is extended to group realizations with a new and simpler proof, based on a controller granule decomposition of the behavior and known controllability results for group realizations. Further controllability results are given; e.g., a trellis realization is controllable if and only if its top (controllability) granule is trivial.
Cite
@article{arxiv.1502.06491,
title = {Unique Factorization and Controllability of Tail-Biting Trellis Realizations via Controller Granule Decompositions},
author = {G. David Forney},
journal= {arXiv preprint arXiv:1502.06491},
year = {2015}
}
Comments
5 pages, 2 figures. To be presented at the IEEE Information Theory Workshop, Jerusalem, April 2015