Parameter Identification of Fractional-Order Discrete Chaotic Systems
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Research on fractional-order discrete chaotic systems has grown in recent years, and chaos synchronization of such systems is a new topic. To address the deficiencies of the extant chaos synchronization methods for fractional-order discrete chaotic systems, we proposed an improved particle swarm optimization algorithm for the parameter identification. Numerical simulations are carried out for the Hénon map, the Cat map, and their fractional-order form, as well as the fractional-order standard iterated map with hidden attractors. The problem of choosing the most appropriate sample size is discussed, and the parameter identification with noise interference is also considered. The experimental results demonstrate that the proposed algorithm has the best performance among the six existing algorithms and that it is effective even with random noise interference. In addition, using two samples offers the most efficient performance for the fractional-order discrete chaotic system, while the integer-order discrete chaotic system only needs one sample.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Differential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
Particle swarm optimization algorithm: An overview
Wang, D., Tan, D., & Liu, L. (2018) · Soft Computing · doi:10.1007/s00500-016-2474-6 · Cited by 3,343
Cryptanalysis and enhancements of image encryption based on three-dimensional bit matrix permutation
Wu, J., Liao, X., & Yang, B. (2018) · Signal Processing · doi:10.1016/j.sigpro.2017.06.014 · Cited by 110
Cited by
SEIR modeling of the COVID-19 and its dynamics
He, S., Peng, Y., & Sun, K. (2020) · Nonlinear Dynamics · doi:10.1007/s11071-020-05743-y · Cited by 712
Self-citationWang, X., & Li, Y. (2021) · Optics and Lasers in Engineering · doi:10.1016/j.optlaseng.2020.106393 · Cited by 141
A visually secure asymmetric image encryption scheme based on RSA algorithm and hyperchaotic map
Xu, Q., Sun, K., & Zhu, C. (2020) · Physica Scripta · doi:10.1088/1402-4896/ab52bc · Cited by 39
“In general, the initial values and parameters of the 1D chaotic maps can be easily estimated [29, 30], so the image encryption algorithms using them are unsafe [31].”
BackgroundSelf-citationFractional-order Polynomial Wiener System Identification
Marzougui, S., Atitallah, A., Bedoui, S., & Abderrahim, K. (2019) · 2019 International Conference on Signal, Control and Communication (SCC) · doi:10.1109/scc47175.2019.9116155 · Cited by 6
Metadata
- Authors
- Peng, Y., Sun, K., He, S., & Peng, D.
- Venue
- Entropy
- Publisher
- MDPI AG
- Published
- 2019-01-01
- Volume
- 21
- Issue
- 1
- Pages
- 27
- ISSN
- 1099-4300 (ISSN-L)
- OpenAlex
- W2907806395
- Cited by
- 52
- References
- 3
- FWCI
- 4.10
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Parameter Identification of Fractional-Order Discrete Chaotic Systems. https://app.cochat.ai/papers/10.3390/e21010027
- The paper
- Peng, Y., Sun, K., He, S., & Peng, D. (2019). Parameter Identification of Fractional-Order Discrete Chaotic Systems. Entropy. https://doi.org/10.3390/e21010027
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.