MétaCan
Menu
Back to cohort
Record W1985438012 · doi:10.1109/fpl.2006.311200

Power Implications of Implementing Logic Using FPGA Embedded Memory Arrays

2006· article· en· W1985438012 on OpenAlexaff
Scott Y. L. Chin, Clarence S. P. Lee, Steven J. E. Wilton

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicLow-power high-performance VLSI design
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer scienceField-programmable gate arrayElectronic circuitComputing with MemoryPower (physics)StratixEmbedded systemLogic gateFlexibility (engineering)Electronic engineeringRegistered memoryParallel computingSemiconductor memoryComputer hardwareExtended memoryElectrical engineeringEngineeringAlgorithm

Abstract

fetched live from OpenAlex

This paper investigates the power and energy implications of using embedded FPGA memory arrays to implement logic. Previous studies have shown that this technique provides extremely dense implementations of some types of logic circuits, however, these previous studies did not evaluate the impact on power. The authors measure the effects on power and energy as a function of three architectural parameters: the number of available memory arrays, the size of the memory arrays, and the flexibility of the memory arrays. It was shown in this paper that although embedded memories provide area efficient implementations of many circuits, this technique results in additional power consumption. When power can be traded off for density, it was also shown that for most array sizes, the arrays should be as flexible as possible, and that smaller memory arrays are more power efficient than large arrays. When larger arrays are desired for more density improvement, non-square memories with more rows than columns are better. The results were obtained from fully place and routed circuits using modified versions of VPR and the Poon power model. Several results were also verified through measurements on a 0.13mum CMOS FPGA (Altera Stratix EP1S40)

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 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: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.297
Threshold uncertainty score0.858

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.0010.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.016
GPT teacher head0.245
Teacher spread0.229 · 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 teacher head, 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

Citations6
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicLow-power high-performance VLSI designFrench-language works237,207