Functional simulation using binary decision diagrams

Authors:
Christoph Scholl;Rolf Drechsler;Bernd Becker
Affiliations:
Institute of Computer Science, Albert-Ludwigs-University, 79110 Freiburg im Breisgau, Germany;Institute of Computer Science, Albert-Ludwigs-University, 79110 Freiburg im Breisgau, Germany;Institute of Computer Science, Albert-Ludwigs-University, 79110 Freiburg im Breisgau, Germany
Venue:
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Year:
1997

Citing 6
Cited 12

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Computer organization & design: the hardware/software interface

Computer organization & design: the hardware/software interface
Fast discrete function evaluation using decision diagrams

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Fast functional simulation using branching programs

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Dynamic variable ordering for ordered binary decision diagrams

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
On variable ordering of binary decision diagrams for the application of multi-level logic synthesis

EURO-DAC '91 Proceedings of the conference on European design automation

Hybrid techniques for fast functional simulation

DAC '98 Proceedings of the 35th annual Design Automation Conference
dibSIM: a parallel functional logic simulator allowing dynamic load balancing

Proceedings of the conference on Design, automation and test in Europe
An efficient heuristic for state encoding minimizing the BDD representations of the transistion relations of finite state machines

ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
The multiple variable order problem for binary decision diagrams: theory and practical application

Proceedings of the 2001 Asia and South Pacific Design Automation Conference
A Parallel LCC Simulation System

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Minimization of the expected path length in BDDs based on local changes

Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Improving EA-based design space exploration by utilizing symbolic feasibility tests

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Evaluation of multiple-output logic functions using decision diagrams

ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
A Technique for Representing Multiple Output Binary Functions with Applications to Verification and Simulation

IEEE Transactions on Computers
Modular construction of model partitioning processes for parallel logic simulation

International Journal of Computational Science and Engineering
Binary decision diagrams: a mathematical model for the path-related objective functions

SMO'06 Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization
A microcanonical optimization algorithm for BDD minimization problem

IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many verification techniques fast functional evaluation of a Boolean network is needed. We investigate the idea of using Binary Decision Diagrams (BDDs) for functional simulation. The area-time trade-off that results from different minimization techniques of the BDD is discussed. We propose new minimization methods based on dynamic reordering that allow smaller representations with (nearly) no runtime penalty.