Sciweavers

141 search results - page 8 / 29
» Boolean Function Representation Using Parallel-Access Diagra...
Sort
View
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
13 years 10 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
DAC
1999
ACM
13 years 11 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther
ICCAD
1998
IEEE
82views Hardware» more  ICCAD 1998»
13 years 11 months ago
Symbolic model checking of process networks using interval diagram techniques
In this paper, an approach to symbolic model checking of process networks is introduced. It is based on interval decision diagrams (IDDs), a representation of multi-valued functio...
Karsten Strehl, Lothar Thiele
IPPS
2006
IEEE
14 years 22 days ago
Placement and routing of Boolean functions in constrained FPGAs using a distributed genetic algorithm and local search
In this work we present a system for implementing the placement and routing stages in the FPGA cycle of design, into the physical design stage. We start with the ISCAS benchmarks,...
Manuel Rubio del Solar, Juan Manuel Sánchez...
ASPDAC
2007
ACM
158views Hardware» more  ASPDAC 2007»
13 years 10 months ago
Symbolic Model Checking of Analog/Mixed-Signal Circuits
This paper presents a Boolean based symbolic model checking algorithm for the verification of analog/mixedsignal (AMS) circuits. The systems are modeled in VHDL-AMS, a hardware des...
David Walter, Scott Little, Nicholas Seegmiller, C...