MétaCan
Menu
Back to cohort
Record W1571743437 · doi:10.1109/iscas.1994.409599

A CMOS current-mode PWM technique for analog neural network implementations

2002· article· en· W1571743437 on OpenAlexaff
Hong-Kui Yang, E.I. El-Masry

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Memory and Neural Computing
Canadian institutionsTechnical University of Nova Scotia
Fundersnot available
KeywordsPulse-width modulationIntegratorCMOSArtificial neural networkComputer scienceElectronic engineeringModular designOperational transconductance amplifierTransconductanceAmplifierModulation (music)Current (fluid)Operational amplifierTopology (electrical circuits)Electrical engineeringVoltageEngineeringArtificial intelligenceBandwidth (computing)TransistorPhysicsTelecommunications

Abstract

fetched live from OpenAlex

In this paper, a CMOS current-mode pulse width modulation (PWM) technique for efficiently implementing analog neural networks is presented. The weighted summation operation (required for a neural network) is realized by switching a weight current, controlled by a pulse whose width is proportional to an input current. This current is then applied to a resettable current integrator. The sigmoid transformation is naturally performed by the nonlinear transconductance amplifier which forms the integrator. This results in minimum silicon area and therefore is suitable for very large scale neural systems. Other pronounced features of the current-mode PWM technique are its easy programmability, electronically adjustable gains of neurons, and modular structures. In this paper, four modules are introduced with which almost all neural networks can be realized modularly. Simulations are provided to verify the validity of our proposed technique.>

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

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

Opus teacher head0.046
GPT teacher head0.319
Teacher spread0.273 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

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

Quick stats

Citations5
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Memory and Neural ComputingFrench-language works237,207