• DocumentCode
    910324
  • Title

    New detection algorithm with reduced complexity

  • Author

    Benelli, G. ; Fantacci, R.

  • Author_Institution
    Dipartimento di Ingegneria Elettronica, Firenze Univ., Italy
  • Volume
    137
  • Issue
    1
  • fYear
    1990
  • Firstpage
    47
  • Lastpage
    59
  • Abstract
    A new algorithm for detecting and/or decoding of signals in communication system is presented. The advantage of the proposed suboptimum algorithm with respect to the classical maximum likelihood detection (MLSE) method lies in the significant reduction in computation complexity attainable by associating a reliable information to each received signal. At the same time, the error probability is maintained close to MLSE levels through the proper selection of the reliability information. The authors describe the application of the proposed algorithm to some interesting cases, such as the detection of continuous phase modulations with and without combined channel coding, detection of Ungerboeck codes, use in conjunction with the Viterbi algorithm. In all cases, a new reduction in computation complexity with respect to the classical MLSE algorithm is achieved.<>
  • Keywords
    computational complexity; decoding; digital communication systems; phase modulation; signal detection; CPM detection; Ungerboeck codes detection; Viterbi algorithm; combined channel coding; detection algorithm; error probability; reduced computation complexity; reliability information; signal decoding;
  • fLanguage
    English
  • Journal_Title
    Communications, Speech and Vision, IEE Proceedings I
  • Publisher
    iet
  • ISSN
    0956-3776
  • Type

    jour

  • Filename
    218035