MétaCan
Menu
Back to cohort
Record W1551456964 · doi:10.1049/iet-cdt.2011.0089

Decimal floating-point antilogarithmic converter based on selection by rounding: algorithm and architecture

2012· article· en· W1551456964 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIET Computers & Digital Techniques · 2012
Typearticle
Languageen
FieldComputer Science
TopicNumerical Methods and Algorithms
Canadian institutionsUniversity of Saskatchewan
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsRoundingDecimalCORDICComputer scienceCritical path methodParallel computingAlgorithmFloating pointDouble-precision floating-point formatStandard cellField-programmable gate arrayLatency (audio)ArchitectureArithmeticComputer hardwareMathematicsIntegrated circuitEngineering

Abstract

fetched live from OpenAlex

This study presents the algorithm and architecture of the decimal floating-point (DFP) antilogarithmic converter, based on the digit-recurrence algorithm with selection by rounding. The proposed approach can compute faithful DFP antilogarithmic results for any one of the three DFP formats specified in the IEEE 754-2008 standard. The proposed architecture is synthesised with an STM 90-nm standard cell library and the results show that the critical path delay and the number of clock cycles of the proposed Decimal64 antilogarithmic converter are 1.26 ns (28.0 FO4) and 19, respectively, and the total hardware complexity is 29325 NAND2 gates. The delay estimation results of the proposed architecture show that it has a significant decrease in terms of latency in contrast with recently published high performance decimal CORDIC implementations.

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 categoriesMeta-epidemiology (narrow)
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.994
Threshold uncertainty score1.000

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.0010.001
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.009
GPT teacher head0.251
Teacher spread0.242 · 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