Reducing complexity of tail-biting trellises
classification
💻 cs.IT
cs.SYmath.IT
keywords
irreducibilitylocalsufficienttail-bitingtrellisesalmostamountbranch-trim
read the original 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.
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.