ACM DL

Design Automation of Electronic Systems (TODAES)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Design Automation of Electronic Systems (TODAES), Volume 2 Issue 3, July 1997

A survey of Boolean matching techniques for library binding
Luca Benini, Giovanni De Micheli
Pages: 193-226
DOI: 10.1145/264995.264996
When binding a logic network to a set of cells, a fundamental problem is recognizing whether a cell can implement a portion of the network. Boolean matching means solving this task using a formalism based on Boolean algebra. In its simplest...

Datapath scheduling with multiple supply voltages and level converters
Mark C. Johnson, Kaushik Roy
Pages: 227-248
DOI: 10.1145/264995.264997
We present an algorithm called MOVER (Multiple Operating Voltage Energy Reduction) to minimize datapath energy dissipation through use of multiple supply voltages. In a single voltage design, the critical path length, clock period, and number of...

Event propagation conditions in circuit delay computation
Hakan Yalcin, John P. Hayes
Pages: 249-280
DOI: 10.1145/264995.264998
Accurate and efficient computation of delays is a central problem in computer-aided design of complex VLSI circuits. Delays are determined by events (signal transitions) propagated from the inputs of a circuit to its outputs, so precise...

Algorithms to compute bridging fault coverage of IDDQ test sets
Paul Thadikaran, Sreejit Chakravarty, Janak Patel
Pages: 281-305
DOI: 10.1145/264995.264999
We present two algorithms, called list-based scheme and tree-based scheme, to compute bridging fault (BF) coverage of IDDQ tests. These algorithms use the novel ideal of “indistinguishable...