2000 character limit reached
Unique Factorization and Controllability of Tail-Biting Trellis Realizations via Controller Granule Decompositions
Published 23 Feb 2015 in cs.IT, cs.SY, and math.IT | (1502.06491v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper.