Skip to main content

Bifurcations and Chaos in Turbo Decoding Algorithms

  • Applications
  • Chapter
  • First Online:
Bifurcation Control

Part of the book series: Lecture Notes in Control and Information Science ((LNCIS,volume 293))

  • 619 Accesses

Abstract

The turbo decoding algorithm is a high-dimensional dynamical system parameterized by a large number of parameters (for a practical realization the turbo decoding algorithm has more than 103 variables and is parameterized by more than 103 parameters). In this chapter we treat the turbo decoding algorithm as a dynamical system parameterized by a single parameter that closely approximates the signal-to-noise ratio (SNR). A whole range of phenomena known to occur in nonlinear systems, like the existence of multiple fixed points, oscillatory behavior, bifurcations, chaos and transient chaos are found in the turbo-decoding algorithm. We develop a simple technique to control transient chaos in turbo decoding algorithm and improve the performance of the standard turbo codes.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Editor information

Guanrong Chen David J. Hill Xinghuo Yu

Rights and permissions

Reprints and permissions

About this chapter

Cite this chapter

Tasev, Z., Popovski, P., Maggio, G.M., Kocarev, L. Bifurcations and Chaos in Turbo Decoding Algorithms. In: Chen, G., Hill, D.J., Yu, X. (eds) Bifurcation Control. Lecture Notes in Control and Information Science, vol 293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44925-6_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-44925-6_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40341-8

  • Online ISBN: 978-3-540-44925-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics