Skip to main content

Independence Test of Chaotic Sequences

  • Conference paper
  • First Online:
  • 844 Accesses

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 57))

Abstract

For the last several years, chaotic sequences have been considered and used in many applications to produce pseudorandom sequences; this has been motivated by the fact that chaotic systems are deterministic sources demonstrating some random features. Many research works have studied these features and analyzed and measured the randomness of these sequences. In particular, it has been shown that under some assumptions, a chaotic sequence can be a random source that delivers continuous random variables with invariant probability density. In many works it has been assumed that chaotic sequences generated by a nonlinear map and beginning with two different initial conditions are independent. The aim of this paper is to analyze the extent to which this is true and to measure this independence.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

References

  1. Pareschi, F.: Chaos based random number generators: Monolithic implementation, testing and applications. Ph.D. thesis, Università di Bologna, December (2006)

    Google Scholar 

  2. Fournier-Prunaret, D., Taha, A.: Chaotic sequences as pseudo-random sequences obtained from 2-dimensional maps. IJAMAS 26(2), 92–105 (2012)

    MathSciNet  Google Scholar 

  3. Zheng, F., Tian, X., Song, L., Li, X.: Pseudo-random sequences generator based on the generalised Hénon map. J. China Univ. Posts Telecommun. 15(3), 64–68 (2008)

    Google Scholar 

  4. Kohda, T., Fujisaki, H., Ideue, S.: On distributions of correlation values of spreading sequences based on Markov information sources. In: Proceedings of ISCAS’2000, pp. 225–228 (2000)

    Google Scholar 

  5. Kohda, T., Tsuneda, A.: Explicit evaluations of correlation functions of Chebyshev binary and bit sequences based on Perron–Frobenius operator. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E77-A, 1794–1800 (1994)

    Google Scholar 

  6. Götz, M., Schwarz, W.: Spectral decomposition of the Frobenius–Perron operator and higher-order correlation functions of one-dimensional chaotic systems with fully stretching maps. In: Proceedings of European Conference on Circuit Theory Design, pp. 1253–1258 (1997)

    Google Scholar 

  7. Kohda, T., Fujisaki, H.: The Jacobian elliptic Chebyshev rational maps can generate sequences of iid random variables. In: Proceedings of ISCAS’2000, pp. 221–224 (2000)

    Google Scholar 

  8. Chargé, P., Fournier-Prunaret, D., Guglielmi, V.: Features analysis of a parametric PWL chaotic map and its utilization for secure transmissions. Chaos Soliton. Fract. 38(5), 1411–1422 (2008)

    Article  Google Scholar 

  9. Mazzini, G., Setti, G., Rovatti, R.: Chaotic complex spreading sequences for asynchronous DS-CDMA-Part I: System modeling and results. IEEE Trans. Circuit Syst. I 44, 937–947 (1997)

    Article  MathSciNet  Google Scholar 

  10. Rovatti, R., Setti, G., Mazziniv, G.: Chaotic complex spreading sequences for asynchronous DS-CDMA-Part II: Some theoretical performance bounds. IEEE Trans. Circuit Syst. I 45, 496–506 (1998)

    Article  MATH  Google Scholar 

  11. Broomhead, D.S., Huke, J.P., Muldoon, M.R.: Codes for spread spectrum, applications generated using chaotic dynamical systems. Dyn. Stab. Syst. 14(1), 95–105 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  12. Kaddoum, G.: Contributions á l’amélioration des systèmes de communication multi-utilisateurs par chaos: synchronisation et analyse des performances. Ph.D. thesis, INSA Toulouse (2008)

    Google Scholar 

  13. Caroll, T.L.: Spread spectrum sequences for unstable periodic orbits. IEEE. Trans. Circuit Syst. Part I 47(4), 443–447 (2000)

    Article  Google Scholar 

  14. Ben Jemaa, Z., Marcos, S., Belghith, S.: Performances of MMSE receiver when using super stable orbits based spreading sequences in DS-CDMA System. In: Proceedings of Eusipco (2000)

    Google Scholar 

  15. Hartmann, A.K.: Introduction to Randomness and Statistics. Wiley, New York (2000)

    Google Scholar 

  16. Chase, W., Brown, F.: General Statistics. World Scientific, Singapore (2009)

    Google Scholar 

  17. Cencini, M., Cecconi, F., Vilpiani, A.: Chaos, from Simple Models to Complex Systems. World Scientific Publishing Co. Pte. Ltd, Singapore (2010)

    MATH  Google Scholar 

Download references

Acknowledgements

We thank Dr. Viktor Avrutin for interesting and helpful discussions during the NOMA workshop.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zouhair Ben Jemaa .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this paper

Cite this paper

Jemaa, Z.B., Fournier-Prunaret, D., Belghith, S. (2014). Independence Test of Chaotic Sequences. In: Grácio, C., Fournier-Prunaret, D., Ueta, T., Nishio, Y. (eds) Nonlinear Maps and their Applications. Springer Proceedings in Mathematics & Statistics, vol 57. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-9161-3_10

Download citation

Publish with us

Policies and ethics