MétaCan
Menu
Back to cohort
Record W2025617638 · doi:10.1109/newcas.2012.6328944

An improved BCD adder using 6-LUT FPGAs

2012· article· en· W2025617638 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
KeywordsAdderDecimalComputer scienceLookup tableField-programmable gate arrayArithmeticCarry-save adderParallel computingSerial binary adderOperandReduction (mathematics)Computer hardwareCritical path methodVirtexMathematicsEngineeringTelecommunications

Abstract

fetched live from OpenAlex

The need for high performance decimal arithmetic is required in many applications. Using binary system to process decimal numbers tends to be costly in terms of area and speed. Hence, there is a demand to realize decimal operations efficiently. In this paper, an improved approach to implement decimal addition is proposed. A hardware implementation of this arithmetic function is developed based on 6-input LUTs and the fast carry chains. In our proposed approach, a new architecture of a BCD adder is presented with emphasis on critical path delay reduction. The adder architecture has been implemented on Xilinx Virtex-6 FPGA for operand sizes from 2 to 18 digits. Our design has outperformed other approaches in terms of area and delay. On average, the delay reduction is 13.1% and LUT saving is 28.9% compared to a conventional BCD adder.

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

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.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.045
GPT teacher head0.347
Teacher spread0.301 · 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

Citations11
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicNumerical Methods and AlgorithmsFrench-language works237,207