The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Generating Multi-Scroll Chua’s Attractors via Simplified Piecewise-Linear Chua’s Diode
Open accessAbstract
High implementation complexity of multi-scroll circuit is a bottleneck problem in real chaos-based communication. Especially, in multi-scroll Chua's circuit, the simplified implementation of piecewise-linear resistors with multiple segments is difficult due to their intricate irregular breakpoints and slopes. To solve the challenge, this paper presents a systematic scheme for synthesizing a Chua's diode with multi-segment piecewise-linearity, which is achieved by cascading even-numbered passive nonlinear resistors with odd-numbered ones via a negative impedance converter. The traditional voltage mode op-amps are used to implement nonlinear resistors. As no extra DC bias voltage is employed, the scheme can be implemented by much simpler circuits. The voltage-current characteristics of the obtained Chua's diode are analyzed theoretically and verified by numerical simulations. Using the Chua's diode and a second-order active Sallen-Key high-pass filter, a new inductor-free Chua's circuit is then constructed to generate multi-scroll chaotic attractors. Different number of scrolls can be generated by changing the number of passive nonlinear resistor cells or adjusting two coupling parameters. Besides, the system can be scaled by using different power supplies, satisfying the low-voltage low-power requirement of integrated circuit design. The circuit simulations and hardware experiments both confirmed the feasibility of the designed system.
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
Determining Lyapunov exponents from a time series
Wolf, A., Swift, J. B., Swinney, H. L., & Vastano, J. A. (1985) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(85)90011-9 · Cited by 9,499
Cryptanalyzing an image encryption algorithm based on autoblocking and electrocardiography
Li, C., Lin, D., Lü, J., & Hao, F. (2018) · IEEE MultiMedia · doi:10.1109/mmul.2018.2873472 · Cited by 261
Self-citationCryptanalysis of a Chaotic Image Encryption Algorithm Based on Information Entropy
Li, C., Lin, D., Feng, B., Lu, J., & Hao, F. (2018) · IEEE Access · doi:10.1109/access.2018.2883690 · Cited by 247
Self-citationWhen an attacker meets a cipher-image in 2018: A year in review
Li, C., Zhang, Y., & Xie, E. Y. (2019) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2019.102361 · Cited by 217 · cited 1×
“The representative image encryption schemes published in year 2018 are reviewed in [50].”
MethodSelf-citation
Cited by
Brain-Like Initial-Boosted Hyperchaos and Application in Biomedical Image Encryption
Lin, H., Wang, C., Cui, L., Sun, Y., Xu, C., & Yu, F. (2022) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2022.3155599 · Cited by 291
Discrete Memristor Hyperchaotic Maps
Bao, H., Hua, Z., Li, H., Chen, M., & Bao, B. (2021) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2021.3082895 · Cited by 254
Self-citationCryptanalysis of an image block encryption algorithm based on chaotic maps
Ma, Y., Li, C., & Ou, B. (2020) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2020.102566 · Cited by 100
Self-citationDiscrete memristive neuron model and its interspike interval-encoded application in image encryption
Bao, H., Hua, Z., Liu, W., & Bao, B. (2021) · Science China Technological Sciences · doi:10.1007/s11431-021-1845-x · Cited by 85
Self-citation
Metadata
- Authors
- Wang, N., Li, C., Bao, H., Chen, M., & Bao, B.
- Venue
- IEEE Transactions on Circuits and Systems I: Regular Papers
- Published
- 2019-12
- Volume
- 66
- Issue
- 12
- Pages
- 4767-4779
- ISSN
- 1549-8328 (ISSN-L)
- 1558-0806
- OpenAlex
- W2969551671
- Cited by
- 191
- References
- 4
- FWCI
- 10.20
- Type
- journal article
- Language
- en
- Open access
- green
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
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.