Programmable constant phase element realization with crossbar arrays
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
INTRODUCTION: Constant Phase Elements (CPEs) have been widely used in many applications due to the extra degree of freedom, which offers new responses and behaviors. OBJECTIVES: This paper proposes a new programmable CPE realization using resistive crossbar arrays. By programming the resistive devices, different CPEs can be obtained. METHODS: The proposed realization can be approximated as a weighted sum of low and high pass filters having the same cut-off frequency (i.e., Lapicque model). The closed-form approximation expression is derived, and then the Flower Pollination Algorithm (FPA) is used to find the optimal values of the network components. RESULTS: rad/sec to prove the ability of this realization achieving any fractional order with less than 5% relative error in both phase and pseudo-capacitance. Monte-Carlo simulations are performed to evaluate the sensitivity of the proposed realization against device variability. In addition, multiple CPEs can be designed at the same time by utilizing the multiple ports of the crossbar array. The proposed realization is compared with two other state-of-art realizations showing comparable results as standalone realization and within fractional-order relaxation oscillator application. CONCLUSION: The proposed crossbar realization has proven its ability to realize any CPE with acceptable error. In addition, this multiple-port design offers high flexibility and on-the-fly switching of the CPE.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| 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.002 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it