MétaCan
Menu
Back to cohort
Record W2304461947 · doi:10.1109/icm.2015.7437978

Reducing the number of embedded multipliers in squaring large size complex numbers

2015· article· en· W2304461947 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 institutionsRoyal Military College of Canada
Fundersnot available
KeywordsMultiplier (economics)Partition (number theory)ArithmeticMathematicsField-programmable gate arrayComputer scienceDiscrete mathematicsParallel computingAlgorithmCombinatoricsComputer hardware

Abstract

fetched live from OpenAlex

To square large size complex numbers using n×n embedded multipliers as in using FPGAs, one needs to first partition the real and imaginary parts into segments of size less or equal to n and then to multiply the segments using these embedded multipliers. When the size of some segments is small, we show that three multiplications can be carried out using one n×n multiplier thus two n×n embedded multipliers can be saved. The idea is also applicable in carrying out two small squarers using one n×n embedded multiplier.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.923
Threshold uncertainty score0.275

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.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.054
GPT teacher head0.345
Teacher spread0.291 · 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
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicNumerical Methods and AlgorithmsFrench-language works237,207