Proceedings of the 41st Annual Design Automation Conference 2004
DOI: 10.1145/996566.996728
|View full text |Cite
|
Sign up to set email alerts
|

Fast hazard detection in combinational circuits

Abstract: In designing asynchronous circuits it is critical to ensure that circuits are free of hazards in the specified set of input transitions. In this paper, two new algorithms are proposed to determine if a combinational circuit is hazard-free without exploring all its gates, thus providing more efficient hazard detection. Experimental results indicate that the best new algorithm on average visits only 20.7% of the original gates, with an average runtime speedup of 1.69 and best speedup of 2.27 (for the largest exa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2006
2006
2016
2016

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…This method reaches its goal by algebraically manipulating the logic function and using binary decision graphs, as presented by R. Bryant, S. Ackers, S.M. Nowick, C. Jeong, Berthomieu B. and J. Brzozowski [4][5][6][7][8][9][10][11][12]. However, this method, will not describe the hazard's evolution (at least not completely), meaning that no timing information will be revealed.…”
Section: Introductionmentioning
confidence: 99%
“…This method reaches its goal by algebraically manipulating the logic function and using binary decision graphs, as presented by R. Bryant, S. Ackers, S.M. Nowick, C. Jeong, Berthomieu B. and J. Brzozowski [4][5][6][7][8][9][10][11][12]. However, this method, will not describe the hazard's evolution (at least not completely), meaning that no timing information will be revealed.…”
Section: Introductionmentioning
confidence: 99%