Hiring in life sciences? Share your open positions with our professional community. Read more Close

Advertisement

Multi-chaotic signal identification employing a causal cross-correlation neural network.

Created on 03 Jul 2026

Authors

Bingrui Wang, Xinyang Piao, Chengbin Chen, Ente Guo, Xingang Zhang

Published in

iScience. Volume 29. Issue 7. Pages 116164. Jul 17, 2026. Epub Jun 26, 2026.

Abstract

Chaos identification plays a crucial role in comprehending complex systems. However, current methods face three challenges: neglect temporal causality, lack robustness against noise, and identify a limited number of chaotic signals. To address the challenges, we focus on identifying multi-chaotic signals with noise interference. First, this study examines 15 types of chaos models. We propose an acquisition-enhanced Bayesian optimization to improve the Swish-modulo map, which is then verified using the maximum Lyapunov exponent. Second, we present a causal cross-correlation network for chaos identification, which incorporates a learnable wavelet transform, time-frequency feature fusion, and spectral-inversion-free fast Fourier transform-based cross-correlation (SFFT-CC). Consequently, experimental results show that the chaos identification accuracy reaches 96.67% at a 20 dB noise. The SFFT-CC outperforms the traditional dilated convolution by up to 5.42% in chaos identification accuracy, while achieving a 43-fold reduction in training time. Theoretical analyses are provided to elucidate these results.

PMID:
42396408
Bibliographic data and abstract were imported from PubMed on 03 Jul 2026.

Read full publication at:
Please sign in to see all details.

Advertisement

Stats

  • Community rating n/a 0 votes
  • Reviewers' rating n/a 0 votes
  • Your rating

1-terrible, 9-excellent. How would you rate this publication? Sign in in to submit your rating.

  • Recommendations n/a n/a positive of 0 vote(s)
  • Views 4
  • Comments 0

Recommended by

  • No recommendations yet.

Post a comment

You need to be signed in to post comments. You can sign in here.

Comments

There are no comments yet.

Advertisement