Skip to main content

Performance Analysis of an Improved 4-Order Chebyshev Chaotic Sequence

  • Conference paper
Communications and Information Processing

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 288))

  • 1985 Accesses

Abstract

Based on the idea of 32 bits integer quantization, this paper presents a efficient method to generate an improved 4-order Chebyshev chaotic sequence. The mathematical model and probability density analysis have been carried out with the sequence. Compared with m sequence in the autocorrelation and cross-correlation characteristics property, the findings of theoretical analysis and the experiments show that the improved sequence maintains good performance.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Palmore, J.: Chaos and Fractal. Computer Arithmetic. Physics 42, 99–110 (1990)

    Google Scholar 

  2. Jie, G., Lin, W., Zhi, L.: Analysis and comparison of Chebyshev chaotic sequence and m sequence. Journal of Chongqing University of Posts and Telecommunications (December 1999)

    Google Scholar 

  3. Zhang, X., Fan, J.: Extended Logistic chatic sequence and its performance analysis. Tsinghua Science and Technology, 156–161 (July 2007)

    Google Scholar 

  4. Hai, W., Hu, J.: The improved Logistic-Map chaotic spread spectrum sequences. Journal of China Institute of Communications 18(8), 71–77 (1997)

    Google Scholar 

  5. Yan, S., Chen, Y.: Performance analysis of full mapping chaotic sequence about Logistic. Modern Electronics Technique 3, 194–199 (2010)

    Google Scholar 

  6. Zhu, Z., Wu, Y., Liu, X., Zhu, W.: Chaotic spread spectrum sequence by Mid Multi-Bit quantifying and its properties. Journal of Northeastern University 23(8), 733–737 (2002)

    Google Scholar 

  7. Zhu, J.: Spread Spectrum Communication and Its Application. China University of Technology Press, Hefei (1993)

    Google Scholar 

  8. Lei, L., Ma, G., Cai, X., Shi, X.: Study of chaotic squence based on Chebyshev mapping. Computer Engineering 35(24), 4–6 (2009)

    Google Scholar 

  9. Sun, Y., Zhao, D., Yu, J., Li, J.: The implementation and application of chaotic sequnce code. Journal of Circuits and Systems, 50–53 (August 2003)

    Google Scholar 

  10. McGillem, C.D., Heidari-Bateri, G.: A chaotic direct-sequence spread spectrum communication system. IEEE Trans. on Communications 42(2), 15324–1527 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, X., Bao, L., Zhao, D., Li, D., He, W. (2012). Performance Analysis of an Improved 4-Order Chebyshev Chaotic Sequence. In: Zhao, M., Sha, J. (eds) Communications and Information Processing. Communications in Computer and Information Science, vol 288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31965-5_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31965-5_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31964-8

  • Online ISBN: 978-3-642-31965-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics