Nonvolatile Delay Flip-Flop Based on Spin-Transistor Architecture and Its Power-Gating Applications
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
We propose and computationally analyze a new type of nonvolatile delay flip-flop (NV-DFF) based on spin-transistor architecture, in which pseudo-spintransistors consisting of an ordinary metal–oxide–semiconductor filed-effect transistor (MOSFET) and a magnetic tunnel junction, referred to as pseudo-spin-MOSFETs are used as a functional nonvolatile storage element. The proposed circuit not only operates as an ordinary DFF, but also is shut down without losing its data. The NV-DFF has only slight increases in circuit delay and layout area within 10% in comparison with an ordinary DFF. Analysis of break-even time (one of the indices for evaluating power-gating efficiency) reveals that the proposed NV-DFF is acceptable for power-gating architecture.
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.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.001 |
| 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