Sciweavers

253 search results - page 15 / 51
» Circuit partitions and
Sort
View
ISQED
2006
IEEE
155views Hardware» more  ISQED 2006»
16 years 2 days ago
FASER: Fast Analysis of Soft Error Susceptibility for Cell-Based Designs
This paper is concerned with statically analyzing the susceptibility of arbitrary combinational circuits to single event upsets that are becoming a significant concern for reliabi...
Bin Zhang, Wei-Shen Wang, Michael Orshansky
ICCAD
1996
IEEE
87views Hardware» more  ICCAD 1996»
15 years 10 months ago
Partitioned ROBDDs - a compact, canonical and efficiently manipulable representation for Boolean functions
We presenta new representationfor Boolean functions called PartitionedROBDDs. In this representation we divide the Boolean space into `k' partitions and represent a function ...
Amit Narayan, Jawahar Jain, Masahiro Fujita, Alber...
ISPD
1999
ACM
79views Hardware» more  ISPD 1999»
15 years 10 months ago
Partitioning with terminals: a "new" problem and new benchmarks
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...
Charles J. Alpert, Andrew E. Caldwell, Andrew B. K...
GECCO
2003
Springer
132views Optimization» more  GECCO 2003»
15 years 11 months ago
Circuit Bipartitioning Using Genetic Algorithm
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
Jong-Pil Kim, Byung Ro Moon
ACSD
2010
IEEE
224views Hardware» more  ACSD 2010»
15 years 4 months ago
Robustness of Sequential Circuits
Digital components play a central role in the design of complex embedded systems. These components are interconnected with other, possibly analog, devices and the physical environm...
Laurent Doyen, Thomas A. Henzinger, Axel Legay, De...