167
Voted
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...
138
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). ...
137
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...
132
Voted
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...
131
click to vote
DAC
15 years 6 months ago
1994 ACM 
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...
|
Computer Architecture