Unique Factorization and Controllability of Tail-Biting Trellis Realizations via Controller Granule Decompositions
classification
💻 cs.IT
cs.SYmath.IT
keywords
controllabilityrealizationsgranuletrelliscontrollerfactorizationgroupresults
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.