• DocumentCode
    1185576
  • Title

    Difference between two soft-decision decoding algorithms

  • Author

    Nilsson, J.E.M.

  • Author_Institution
    Nat. Defence Res. Establ., Linkoping
  • Volume
    30
  • Issue
    20
  • fYear
    1994
  • fDate
    9/29/1994 12:00:00 AM
  • Firstpage
    1665
  • Lastpage
    1666
  • Abstract
    A relationship between two well-known soft-decision decoding algorithms is derived; the generalised minimum distance (GMD) algorithm and the Chase algorithm. The relation shows, in the case of soft-decision decoding of binary block codes, that the weakest third version of the Chase algorithm is more powerful than the GMD algorithm
  • Keywords
    block codes; decoding; signal processing; Chase algorithm; binary block codes; block codes; generalised minimum distance; soft-decision decoding; soft-decision decoding algorithms; weakest third version;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19941169
  • Filename
    328490
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1185576