MétaCan
Menu
Back to cohort
Record W2117005707 · doi:10.1109/newcas.2005.1496664

Optimized Distributed Processing of Scaling Factor-in CORDIC

2005· article· en· W2117005707 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
KeywordsCORDICComputer scienceScalingFactor (programming language)Scale factor (cosmology)Parallel computingPath (computing)Very-large-scale integrationAlgorithmIterative methodMathematicsField-programmable gate arrayComputer hardwareEmbedded system

Abstract

fetched live from OpenAlex

CORDIC is a well known iterative algorithm used to evaluate various transcendental functions. There have been a number of papers describing various ways of speeding up this algorithm. One of the performance bottlenecks of CORDIC is the requirement to multiply the results of the x and y data path by a constant scaling factor. Depending on the architecture, such solutions might not necessarily provide added benefits. In this paper, processing of the scaling factor is applied in a distributed way in order to achieve maximum efficiency for both pipelined and recursive architectures.

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

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.025
GPT teacher head0.304
Teacher spread0.279 · 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

Citations3
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicNumerical Methods and AlgorithmsFrench-language works237,207