Linearly-scalable R-2R Multiply-and-accumulate Architecture for AI Edge Devices
Bibliographic record
Abstract
From the cloud to the user-end, Artificial Intelligence (AI) edge devices have been receiving increasing attention thanks to its benefits including privacy, low latency, and efficient use of bandwidth. However, traditional computing architectures such as CPU and some existing AI accelerator cannot meet the tight energy budget of future AI edge applications. Researchers have been focusing on an emerging computing architecture, computation-in-memory (CIM), which improves both memory access and computation efficiency. This thesis presents a current-domain compute-in-memory (CIM) architecture for acceleration of AI edge inferencing. A novel multiply-and-accumulate (MAC) scheme is introduced by exploiting the R-2R resistor ladder as a binary-weighted current recombiner. The area and power of the proposed scheme scale linearly as numerical precision increases for both input activation and weight. Computation latency is maintained single cycle. A prototype in 22nm FD-SOI CMOS process achieves 2.2ns system latency, 56TOPS/W energy efficiency and 4TOPS/mm2 area efficiency with 6-bit input activation and 8-bit weight.
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.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.006 | 0.002 |
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".