Entropy test for complexity in chaotic time series

• Cho Kenichiro

  Department of Mechanical Engineering, Ritsumeikan University

• Miyano Takaya

  Department of Mechanical Engineering, Ritsumeikan University

抄録

We perform an entropy test, combined with a diagnostic test for the degree of visible determinism, for the complexity in chaotic time series. A time series is coarse-grained into a binary sequence, partitioned into segments of D binary digits, and transformed into a string of “alphabets” binary-coded in D bits. Using the probability density function estimated from the histogram representing the frequencies of appearance of the 2^D alphabets in the string, we calculate the information entropy referred to as the string entropy. Case studies are conducted for numerical time series generated by the logistic map, the tent map, the Lorenz equations, and the augmented Lorenz equations. We discuss the performances of the time series as sequences of pseudorandom numbers for chaotic cryptography.

収録刊行物

• Nonlinear Theory and Its Applications, IEICE

  Nonlinear Theory and Its Applications, IEICE 7 (1), 21-29, 2016

  一般社団法人 電子情報通信学会

キーワード

• entropy test
• augmented Lorenz equations
• pseudorandom numbers
• chaotic cryptography
• time series analysis

詳細情報

• CRID: 1390001205345874688
• NII論文ID: 130005117782
• DOI: 10.1587/nolta.7.21
• ISSN: 21854106
• Web Site: https://www.jstage.jst.go.jp/article/nolta/7/1/7_21/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • Crossref
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可