• DocumentCode
    3127949
  • Title

    Reducing complexity of tail-biting trellises

  • Author

    Gluesing-Luerssen, Heide ; Forney, G. David, Jr.

  • Author_Institution
    Dept. of Math., Univ. of Kentucky, Lexington, KY, USA
  • fYear
    2012
  • fDate
    1-6 July 2012
  • Firstpage
    646
  • Lastpage
    650
  • 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.
  • Keywords
    computational complexity; trellis codes; branch-trim; local irreducibility; reducing complexity; state-trim; tail-biting trellises; trellis realization; uncontrollability; unobservability; Aerospace electronics; Complexity theory; Generators; Merging; Silicon; Trajectory; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • ISSN
    2157-8095
  • Print_ISBN
    978-1-4673-2580-6
  • Electronic_ISBN
    2157-8095
  • Type

    conf

  • DOI
    10.1109/ISIT.2012.6284281
  • Filename
    6284281
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3127949