Design and Realization of a Hyperchaotic Memristive System for Communication System on FPGA
Bibliographic record
Abstract
In this study, a memristor based hyperchaotic circuit is presented and implemented for communication systems on FPGA platform. Four dimensional hyperchaotic system, which contains active flux controlled memristor is designed by using a smooth continuous nonlinearity. Dynamical characteristics of designed hyperchaotic circuit are examined such as equilibrium points, chaotic attractors, Lyapunov exponents and bifurcation diagram. Furthermore, an electronic circuit model of hyperchaotic system has been modeled and results are submitted. Chaotic circuits are used in communication systems especially in secure communication due to their sensitive dependence on the initial conditions, not periodic, and having a spread spectrum. By using nonlinearity of memristor, the signals obtained from memristor based hyperchaotic system have been realized to analog and digital communication schemes on FPGA platform, which is suitable for re-programmable and reconfigurable systems. The success of memristor based hyperchaotic circuit with FPGA based communication is demonstrated by both simulation and experimental results.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".