MétaCan
Menu
Back to cohort
Record W2167718530 · doi:10.1109/ccece.2005.1557027

Effective implementation of floating-point adder using pipelined LOP in FPGAs

2006· article· en· W2167718530 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNumerical Methods and Algorithms
Canadian institutionsUniversity of Saskatchewan
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsAdderField-programmable gate arrayComputer scienceFloating pointParallel computingPoint (geometry)Computer architectureEmbedded systemAlgorithmTelecommunicationsMathematicsLatency (audio)

Abstract

fetched live from OpenAlex

The current intellectual property provided by Xilinx for floating-point adder is not competitive and versatile. This paper presents a hardware implementation of IEEE 754 compliant floating-point adder and a design methodology for floating-point adder with leading-one predictor (LOP). LOP has been used to predict the shift amount for post normalization in parallel with the addition. In some cases, however, there is an error in prediction. LOP used in our design detects this error concurrently with the prediction. Xilinx 6.3 ISE was used to synthesize VHDL implementations for five levels of pipeline stage floating-point adder. LOP was pipelined to three stages, to obtain better latency for some Xilinx FPGA devices compared to the current intellectual property. For Spartan 3 and Virtex 2p FPGA architectures with five stage pipeline implementation, 25% improvement in clock speed was achieved using pipelined LOP.

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.892
Threshold uncertainty score0.486

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.012
GPT teacher head0.328
Teacher spread0.316 · 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

Citations20
Published2006
Admission routes2
Has abstractyes

Explore more

Same topicNumerical Methods and AlgorithmsFrench-language works237,207