Low Power Memristor-Based Shift Register Design
Bibliographic record
Abstract
The use of memristors is considered to be an appropriate alternative solution to Complementary Metal Oxide Semiconductor (CMOS) technology's scaling limitation. In digital design, shift registers are widely used and considered to be basic memory devices. In this paper, a fast and efficient area memristor-only-based shift register, as well as a hybrid CMOS/memristor-based shift register are proposed. Specifically, a 4-bit shift register with only 8 memristor devices and a hybrid CMOS /memristor with 64 memristor devices and 64 CMOS transistors were implemented and simulated using Cadence Virtuoso. The simulation results demonstrate the design's efficient functionality. Compared to the implementation of a CMOS-memristor based shift register, the implementation of the proposed design is more efficient when concerning area and speed with respect to the implementation of the Memristor Based-Material-Implication (IMPLY) memristive shift register. In addition, the shift register with only memristor-based has a significant power reduction of over 30% compared to a CMOS design shift register.
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.005 | 0.001 |
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".