159
click to vote
DAC
15 years 4 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...
131
Voted
DAC
15 years 5 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). ...
129
Voted
DAC
15 years 5 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...
125
Voted
DAC
15 years 5 months ago
1994 ACM 
Current asynchronous tools are focussed mainly on the design of a single interface module. In many applications, one must design interacting interface modules that potentially comm...
123
Voted
DAC
15 years 5 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...
|
Computer Architecture