MétaCan
Menu
Back to cohort
Record W2063927241 · doi:10.1109/cjece.2013.6704691

Leading one detectors and leading one position detectors - An evolutionary design methodology

2013· article· en· W2063927241 on OpenAlexvenueno aff
K. Kunaraj, R. Seshasayanan

Bibliographic record

VenueCanadian Journal of Electrical and Computer Engineering · 2013
Typearticle
Languageen
FieldComputer Science
TopicNumerical Methods and Algorithms
Canadian institutionsnot available
Fundersnot available
KeywordsField-programmable gate arrayComputer scienceElectronic circuitDetectorApplication-specific integrated circuitShufflingGate arrayElectronic engineeringComputer hardwareEngineeringElectrical engineering

Abstract

fetched live from OpenAlex

Design of leading-one detector (LOD) and leading-one position detector (LOPD) are important as they are used for the normalization process in floating-point multiplication, floating-point addition/subtraction and in logarithmic converters. In this paper, the authors propose various gate-level architectures for LOD and LOPD. The LOD and LOPD circuits are evolved using the evolutionary algorithm (EA) and using the evolved lower-order gate structures, various higher-order circuits are constructed. To obtain better results, the EA is modified and a novel shuffling operation is performed to prevent the algorithm from settling in the local minima. Then the constructed LOD and LOPD circuit is synthesized using Cadence® RTLCompiler® using TSMC 180nm library. The LOD and LOPD circuits can be implemented in an Application Specific Integrated circuit (ASIC) or in a Field Programmable Gate Array (FPGA), and hence it is independent of the technology library. Perhaps the evolution can also be made as an intrinsic process during the application run time and the evolved best gate structure can be chosen. We restrict this paper to the extrinsic evolution of LOD and LOPD gate level 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.

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.001
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.002
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.040
GPT teacher head0.238
Teacher spread0.198 · 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 designNot applicable
Domainnot available
GenreMethods

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

Citations25
Published2013
Admission routes1
Has abstractyes

Explore more

Same venueCanadian Journal of Electrical and Computer EngineeringSame topicNumerical Methods and AlgorithmsFrench-language works237,207