MétaCan
Menu
Back to cohort

FinFET 6T-SRAM Compute-in-Memory Targeting Low Power Neural Networks Operations

2023· article· en· W4384947937 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Memory and Neural Computing
Canadian institutionsCarleton University
Fundersnot available
KeywordsStatic random-access memoryBottleneckArtificial neural networkComputer scienceLatency (audio)Power (physics)Parallel computingComputationKey (lock)Computer engineeringComputer hardwareArtificial intelligenceEmbedded systemAlgorithm

Abstract

fetched live from OpenAlex

Modern computing relies on the artificial intelligence (AI) for making independent decisions. AI utilizes neural networks (NN) to handle complex tasks execution such as image recognition, text processing, and language interpretation. However, NNs are extremely data centric and pose performance bottleneck while moving data between memory and processing unit. Compute-in-memory (CIM) addresses this issue but limited attention has been given to the low power neural network operations. This paper proposes a novel CIM solution for multiply and accumulate (MAC) operations without incorporating any dedicated arithmetic units. Proposed CIM makes use of FinFET 6T-SRAM cells, sense amplifiers, write drivers, and NOR gates to achieve the power efficient in-memory computations. Simulations in 12nm FinFET shows that proposed CIM for 2-bit input and 2-bit weights: consumes <tex>$411.2\mu \mathrm{W}$</tex>, exhibits latency of 36.1 ns, and shows maximum power efficiency of 6.51 KOP/W.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.063
Threshold uncertainty score0.672

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.010
GPT teacher head0.233
Teacher spread0.223 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations1
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Memory and Neural ComputingFrench-language works237,207