MétaCan
Menu
Back to cohort
Record W1560978343 · doi:10.1109/iscas.1993.394066

Signal transition graph constraints for speed-independent circuit synthesis

2002· article· en· W1560978343 on OpenAlexaff
Ruchir Puri, J. Gu

Bibliographic record

Venue1993 IEEE International Symposium on Circuits and Systems · 2002
Typearticle
Languageen
FieldEngineering
TopicLow-power high-performance VLSI design
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsAsynchronous communicationCoding (social sciences)Computer scienceGraphTheoretical computer scienceTransition (genetics)AlgorithmMathematicsTelecommunicationsStatistics

Abstract

fetched live from OpenAlex

The synthesis of asynchronous circuits is difficult in VLSI design. Transition based specification such as signal transition graphs (STGs) are simple and powerful in specifying and synthesizing asynchronous behavior. A relationship is established between the signal transition graph syntactic constraints, i.e., persistency and complete state coding (CSC). A direct proof is presented which shows that a persistency violation either does not affect hazards or, if it does, there results a complete state coding violation. The authors' results give the conditions under which a persistency violation may lead to a complete state coding violation.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.616
Threshold uncertainty score1.000

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.030
GPT teacher head0.219
Teacher spread0.188 · 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.

Study designSimulation or modeling
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

Citations5
Published2002
Admission routes1
Has abstractyes

Explore more

Same venue1993 IEEE International Symposium on Circuits and SystemsSame topicLow-power high-performance VLSI designFrench-language works237,207