• DocumentCode
    1370632
  • Title

    A* decoding of block codes

  • Author

    Ekroot, Laura ; Dolinar, Sam

  • Author_Institution
    Jet Propulsion Lab., California Inst. of Technol., Pasadena, CA, USA
  • Volume
    44
  • Issue
    9
  • fYear
    1996
  • fDate
    9/1/1996 12:00:00 AM
  • Firstpage
    1052
  • Lastpage
    1056
  • Abstract
    The A* algorithm is applied to maximum-likelihood soft-decision decoding of binary linear block codes. This paper gives a tutorial on the A* algorithm, compares the decoding complexity with that of exhaustive search and Viterbi decoding algorithms, and presents performance curves obtained for several codes
  • Keywords
    artificial intelligence; block codes; computational complexity; graph theory; linear codes; maximum likelihood decoding; tree searching; A* algorithm; artificial intelligence tree search algorithm; binary linear block codes; decoding complexity; maximum-likelihood soft-decision decoding; performance curves; AWGN; Artificial intelligence; Block codes; Helium; Heuristic algorithms; Maximum likelihood decoding; Propulsion; Space technology; Tree graphs; Viterbi algorithm;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/26.536908
  • Filename
    536908
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1370632