182
Voted
DAC
15 years 6 months ago
1994 ACM 
Today's high-performance single-chip CMOS microprocessors are the most complex and challenging chip designs ever implemented. To stay on the leading edge, Digital's micro...
170
Voted
DAC
15 years 6 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
Voted
DAC
15 years 6 months ago
1994 ACM 
In this paper, we revisit the classical problem of functional decomposition [1, 2] that arises so often in logic synthesis. One basic problem that has remained largely unaddressed...
|
Computer Architecture