• DocumentCode
    2052392
  • Title

    On the complexity of exact maximum likelihood decoding on tail-biting trellises

  • Author

    Shankar, Priti

  • Author_Institution
    Dept. of Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore, India
  • fYear
    2004
  • fDate
    27 June-2 July 2004
  • Firstpage
    104
  • Abstract
    An algorithm for exact maximum likelihood decoding on tail-biting trellises is analyzed and shows that under certain conditions exact maximum likelihood decoding has time complexity O(St log(St)) and where St is the total number of states of the tail-biting trellis.
  • Keywords
    Viterbi decoding; block codes; maximum likelihood decoding; trellis codes; maximum likelihood decoding; tail-biting trellis; Algorithm design and analysis; Automation; Computer science; Costs; Current measurement; Data structures; Hamming weight; Maximum likelihood decoding; Viterbi algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
  • Print_ISBN
    0-7803-8280-3
  • Type

    conf

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