Skip to main content

Detection Methods

  • Chapter
  • First Online:
Introduction to Digital Communications

Part of the book series: Signals and Communication Technology ((SCT))

  • 1387 Accesses

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).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. J. Hagenauer, E. Offer, L. Papke, Iterative decoding of binary block and convolutional codes. IEEE Trans. Inf. Theory 42 (1996)

    Article  Google Scholar 

  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. 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. M. Bernhard, QAM, webdemo, Technical report, Institute of Telecommunications, University of Stuttgart, Germany (2018), http://webdemo.inue.uni-stuttgart.de

  5. J.R. Barry, E.A. Lee, D.G. Messerschmitt, Digital Communication (Springer, Berlin, 2012)

    Google Scholar 

  6. R.E. Bellman, Dynamic Programming (Princeton University Press, Princeton, 1957)

    Google Scholar 

  7. R.E. Bellman, Dynamic Programming (Princeton University Press, Princeton, 2010)

    Google Scholar 

  8. E.W. Dijkstra, A note on two problems in connexion with graphs. Numerische Mathematik 1, 269 (1959)

    Article  MathSciNet  Google Scholar 

  9. A. Viterbi, Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans. Inf. Theory 13, 260 (1967)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Joachim Speidel .

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Speidel, J. (2019). Detection Methods. In: Introduction to Digital Communications. Signals and Communication Technology. Springer, Cham. https://doi.org/10.1007/978-3-030-00548-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00548-1_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00547-4

  • Online ISBN: 978-3-030-00548-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics