A reliable non‐volatile in‐memory computing associative memory based on spintronic neurons and synapses
Bibliographic record
Abstract
Abstract This article introduces an innovative non‐volatile associative memory (AM) that leverages spintronic synapses, employing magnetic tunnel junctions (MTJ) in conjunction with neurons constructed using carbon nanotube field‐effect transistors (CNTFETs). Our proposed design represents a significant advancement in area optimization and outperforms prior designs. We adopt MTJ‐based spintronic devices due to their remarkable attributes, including dependable reconfigurability and nonvolatility. Simultaneously, CNTFETs effectively address the longstanding limitations traditionally associated with MOSFETs. In this work, our proposed design undergoes rigorous simulations that account for process variations. The results demonstrate that our AM system closely approximates its ideal mathematical model, even with significant process variations. Furthermore, we investigate the impact of Tunnel Magnetoresistance (TMR) on the performance of our proposed AM system. Our investigations reveal that, even with a TMR as low as 100%, our design matches and often surpasses the performance of its counterparts operating with a TMR of 300%. This achievement holds profound significance from a fabrication standpoint, as fabricating MTJs with high TMR values can be intricate and costly. Overall, our novel AM system represents a significant breakthrough in emerging technologies, harnessing the unique strengths of spintronic synapses and advanced carbon nanotube transistors while robustly addressing challenges in performance and variability.
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.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".