MétaCan
Menu
Back to cohort
Record W2078478492 · doi:10.1109/fpl.2012.6339160

Runtime reconfigurable DSP unit using one's complement and Minimum Signed Digit

2012· article· en· W2078478492 on OpenAlexaff
Travis Manderson, L.E. Turner

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDigital Filter Design and Implementation
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsDigital signal processingMultiplier (economics)AdderComputer scienceControl reconfigurationField-programmable gate arrayBooth's multiplication algorithmArithmetic logic unitComputer hardwareCarry (investment)Digital signal processorParallel computingArithmeticEmbedded systemMathematicsLatency (audio)Telecommunications

Abstract

fetched live from OpenAlex

A runtime reconfigurable Digital Signal Processing (DSP) unit using one's complement data and a Minimum Signed Digit (MSD) multiplier is described. The MSD multiplier changes the partial product shift-and-add operations to shift-and-add/subtract operations and reduces the number of partial product terms by half, decreasing the size and increasing the speed of the multiplier. Using a carry-save architecture, the propagation delay of an adder to add the carry-out bits is eliminated. Taking advantage of the deterministic nature of the desired DSP algorithm, the runtime reconfiguration of the multiplier can be pipelined to eliminate an added set-up state. The described DSP unit compared to a DSP unit using a conventional multiplier is shown to be 20% faster and 30% smaller for a 32-bit coefficient and using Xilinx Field Programmable Gate Arrays (FPGAs) with 6-input Look-Up Tables (LUTs).

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.007
Threshold uncertainty score0.025

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0070.002

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.119
GPT teacher head0.303
Teacher spread0.184 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicDigital Filter Design and ImplementationFrench-language works237,207