MétaCan
Menu
Back to cohort
Record W2063302371 · doi:10.1109/reconfig.2009.22

A Scalable Architecture for Multivariate Polynomial Evaluation on FPGA

2009· article· en· W2063302371 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
FieldComputer Science
TopicNumerical Methods and Algorithms
Canadian institutionsPolytechnique Montréal
Fundersnot available
KeywordsField-programmable gate arrayComputer scienceScalabilityParallel computingAccelerationPolynomialComputationHardware accelerationArchitectureExploitComputer architectureComputer engineeringEmbedded systemAlgorithmMathematicsOperating system

Abstract

fetched live from OpenAlex

Polynomial evaluation is currently used in multiple domains such as image processing, control systems and applied mathematics. Its high demand in calculation time and the need for embedded solutions make it a good target application for a hardware-oriented solution. This paper presents a new scalable architecture and its FPGA implementation designed to exploit the high level of parallelism present in such applications. Illustrated by an example in the field of 3-D graphic computation, results show important acceleration factors varying from 178 to 880 for orders ranging from 4 to 19, while the associated hardware cost scales linearly with polynomial order. Moreover using parallel implementations of the architecture to evaluate multiple polynomials, acceleration factor as high as 30858 can be obtained compared to an execution on a single processor.

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.001
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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.988
Threshold uncertainty score0.260

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.039
GPT teacher head0.343
Teacher spread0.304 · 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
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicNumerical Methods and AlgorithmsFrench-language works237,207