Advertisement

Detection Methods

  • Joachim SpeidelEmail author
Chapter
Part of the Signals and Communication Technology book series (SCT)

Abstract

In the following, a survey on the most important detection methods is presented. We differentiate in principle between the symbol-by-symbol and the sequence or sequential detection. With the first method, the receive signal q(k) in Figs.  1.1 and  1.5 is decided at every time instant k. The sequential detection scheme takes decisions periodically after the observation of K past samples, e.g., after \(q(0),q(1),\ldots ,q(K-1)\). In this section, we illustrate the key detection methods and consider 4-PSK depicted in Fig. 4.1 as an example. Assume that the intersymbol interference is completely removed and that the signal at the input of the detector is q(k) given by ( 2.3).

References

  1. 1.
    J. Hagenauer, E. Offer, L. Papke, Iterative decoding of binary block and convolutional codes. IEEE Trans. Inf. Theory 42 (1996)CrossRefGoogle Scholar
  2. 2.
    J. Hagenauer, P. Hoeher, A Viterbi algorithm with soft-decision outputs and its applications, in IEEE Internal Conference on Global Communications (GLOBECOM) (1989)Google Scholar
  3. 3.
    J. Hagenauer, The turbo principle: tutorial introduction and state of the art, in Proceedings of 1st International Symposium on Turbo codes (1997)Google Scholar
  4. 4.
    M. Bernhard, QAM, webdemo, Technical report, Institute of Telecommunications, University of Stuttgart, Germany (2018), http://webdemo.inue.uni-stuttgart.de
  5. 5.
    J.R. Barry, E.A. Lee, D.G. Messerschmitt, Digital Communication (Springer, Berlin, 2012)Google Scholar
  6. 6.
    R.E. Bellman, Dynamic Programming (Princeton University Press, Princeton, 1957)Google Scholar
  7. 7.
    R.E. Bellman, Dynamic Programming (Princeton University Press, Princeton, 2010)Google Scholar
  8. 8.
    E.W. Dijkstra, A note on two problems in connexion with graphs. Numerische Mathematik 1, 269 (1959)MathSciNetCrossRefGoogle Scholar
  9. 9.
    A. Viterbi, Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans. Inf. Theory 13, 260 (1967)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Institute of TelecommunicationsUniversity of StuttgartStuttgart, Baden-WurttembergGermany

Personalised recommendations