A Review of Optimizing SRAM-Based FPGA In-memory Computing
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
When the demand for real-time data processing and energy keeps efficiency growing in fields like Advanced Driver-Assistance Systems (ADAS) for electric vehicles, in-memory computing (IMC) is becoming a key technology. The heart of effective IMC is Static Random Access Memory (SRAM). It is widely known for its fast access times and low power requirements. For these reasons, SRAM becomes an ideal choice for FPGA-based systems. This paper delves into optimizing SRAM for IMC by comparing the performance, power efficiency, and stability of three SRAM types: 6T, 8T, and 10 T. What’s more, we introduce the innovative C3SRAM architecture. This technology leverages capacitive coupling to boost computational speed and energy efficiency significantly. Finally, we summarize the CONV-SRAM architecture, tailored for in-memory convolution operations in neural networks. Through these explorations, we provide practical insights into how SRAM can be optimized to meet the demands of high-performance, energy-efficient systems, focusing on applications like autonomous vehicles that require speed and power conservation.
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.001 | 0.001 |
| Meta-epidemiology (broad) | 0.003 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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