2000 character limit reached
Reducing complexity of tail-biting trellises (1202.1336v1)
Published 7 Feb 2012 in cs.IT, cs.SY, and 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.
- Heide Gluesing-Luerssen (38 papers)
- G. David Forney, Jr (3 papers)