MétaCan
Menu
Back to cohort
Record W2137667031 · doi:10.1109/pacrim.1997.620313

Efficient realization for a class of clock-controlled sequence generators

2002· article· en· W2137667031 on OpenAlexaff
Huapeng Wu, M.A. Hasan

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCellular Automata and Applications
Canadian institutionsUniversity of Waterloo
FundersIran Telecommunication Research Center
KeywordsRealization (probability)Shift registerGenerator (circuit theory)Computer scienceScheme (mathematics)Sequence (biology)Very-large-scale integrationLinear feedback shift registerSelf-shrinking generatorThroughputClass (philosophy)Clock generatorConstant (computer programming)Power consumptionComputer hardwarePower (physics)ArithmeticEmbedded systemComputer architectureElectrical engineeringEngineeringClock signalMathematicsVoltageTelecommunicationsInduction generatorArtificial intelligence

Abstract

fetched live from OpenAlex

In this article, the hardware implementation of a 2-2 sequence generator is discussed. A novel architecture for the 1-2 generator using an extended linear feedback shift register (XLFSR) is presented. Compared to the conventional LFSR based schemes, the proposed scheme is advantageous in the sense that it yields generators of high and constant throughput. When this scheme is used to implement generators in VLSI technologies, low area and power consumption are also expected. Moreover, it has been shown that the proposed 1-2 generators are very suitable for building long Gollmann's cascaded generators.

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 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: none
Teacher disagreement score0.969
Threshold uncertainty score0.201

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.031
GPT teacher head0.252
Teacher spread0.221 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
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

Citations0
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicCellular Automata and ApplicationsFrench-language works237,207