ISPD
1999
ACM
14 years 1 months ago
1999
ACM
The sequence-pair was proposed in 1994 as a representation of the packing of rectangles of general structure. Since then, there have been e orts to expand its applicability over s...
ISPD
1999
ACM
14 years 1 months ago
1999
ACM
DATE
1999
IEEE
14 years 1 months ago
1999
IEEE
Emerging design problems are prompting the use of code motion and speculation in high
ISPD
1999
ACM
14 years 1 months ago
1999
ACM
—Maze routing algorithms are widely used for finding an optimal path in detailed routing for very large scale integration, printed circuit board and multichip modules In this pap...
ISPD
1999
ACM
14 years 1 months ago
1999
ACM
The presence of fixed terminals in hypergraph partitioning instances arising in top-down standard-cell placement makes such instances qualitatively different from the free hyperg...
DATE
1999
IEEE
14 years 1 months ago
1999
IEEE
The objective of this paper is to define a minimum number of configurations for testing the configurable modules that interface the global interconnect and the logic cells of SRAM...
DATE
1999
IEEE
14 years 1 months ago
1999
IEEE
A novel approach to testing sequential circuits that uses multi-level decision diagram representations is introduced. The proposed algorithm consists of a combination of scanning ...
DATE
1999
IEEE
14 years 1 months ago
1999
IEEE
In this paper, we consider the problem of maximizing the battery life (or duration of service) in battery-powered CMOS circuits. We first show that the battery efficiency (or utili...
DATE
1999
IEEE
14 years 1 months ago
1999
IEEE
This paper describes a simulation technique for RealTime Hw/Sw systems based on an object executable model. It allows designers to seamlessly estimate and verify their solutions f...
DATE
1999
IEEE
14 years 1 months ago
1999
IEEE
We formalize the problem of analog data compression and analyze the existence of a polynomial data compression function. Under relaxed conditions we explore the existence of a sol...