168
click to vote
DAC
15 years 5 months ago
1994 ACM 
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
144
click to vote
DAC
15 years 6 months ago
1994 ACM 
In this paper, we consider the problem of calculating the signal and transition probabilities of the internal nodes of the combinational logic part of a nite state machine (FSM). ...
139
click to vote
DAC
15 years 6 months ago
1994 ACM 
We provide a new theoretical framework for constructing Steiner routing trees with minimum Elmore delay. Earlier work [3, 13] has established Elmore delay as a high delity estima...
135
click to vote
DAC
15 years 6 months ago
1994 ACM 
-- In this paper we present a new method for Boolean matching of completely specified Boolean functions. The canonical Generalized Reed-Muller forms are used as a powerful analysis...
135
click to vote
DAC
15 years 5 months ago
1994 ACM
-- In previous work, Hu and Dill identified a common cause of BDD-size blowup in high-level design verification and proposed the method of implicitly conjoined invariants to addres...
|
Computer Architecture