MétaCan
Menu
Back to cohort

High-Performance FPGA Implementation of Fully Connected Networks of SAM Neurons

2023· article· en· W4385080043 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 UniversityUniversity of Windsor
Fundersnot available
KeywordsNeuromorphic engineeringComputer scienceField-programmable gate arrayVon Neumann architectureArtificial neural networkComputer architectureNeuronSpiking neural networkComputationArtificial neuronParallel computingEmbedded systemArtificial intelligenceNeuroscienceAlgorithm

Abstract

fetched live from OpenAlex

Neuromorphic computers have been presented as alternatives to traditional von Neumann systems. Neuromorphic systems mimic neural structures of the human brain to make the energy-efficient and high-performance computations. This paper proposes high-speed with no DSP resources FPGA implementation of the SAM neuron model and its fully connected networks with random synaptic weights. The synthesis reports of the implemented SAM neuron with 50, 100, 500, 1000, 2000, 4000, 6000, and 8000 random inputs have been presented. Also, the results of the synthesized fully connected populations comprising 50, 100, 500, 1000, and 1500 SAM neurons have been reported. Accordingly, the FPGA synthesis results of the proposed spiking neuron and networks are noteworthy compared to the state of the arts in terms of performance and DSP resources.

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: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.690
Threshold uncertainty score0.241

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.000
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.015
GPT teacher head0.251
Teacher spread0.236 · 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