Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/ISIT.2012.6284281 | Information Theory Proceedings |
Keywords | DocType | Volume |
computational complexity,trellis codes,branch-trim,local irreducibility,reducing complexity,state-trim,tail-biting trellises,trellis realization,uncontrollability,unobservability | Conference | abs/1202.1336 |
ISSN | ISBN | Citations |
2157-8095 E-ISBN : 978-1-4673-2578-3 | 978-1-4673-2578-3 | 1 |
PageRank | References | Authors |
0.36 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Heide Gluesing-Luerssen | 1 | 69 | 12.81 |
| G. David Forney Jr. | 2 | 79 | 14.53 |