Skip to main content


eCommons@Cornell >
Faculty of Computing and Information Science >
Center for Advance Computing >
Cornell Theory Center Technical Reports >

Please use this identifier to cite or link to this item:
Title: Fast Compiled Logic Simulation Using Linear BDDs
Authors: Gupta, Sudeep
Pingali, Keshav
Keywords: theory center
Issue Date: Jun-1995
Publisher: Cornell University
Abstract: This paper presents a new technique for compiled zero delay logic simulation, and includes extensive experiments that demonstrate its performance on standard benchmarks. Our compiler partitions the circuit into fanout-freeregions (FFRs), transforms each FFR into a linear sized BDD, and converts each BDD into executable code. In our approach, the computation is sublinear in the number of variables within each partition because only one path, from root to leaf, of the BDD is executed; therefore in many cases, substantial computation is avoided. In this way, our approach gets dome to the advantages of oblivious as well as demand-driven evaluation. We investigated the impact of the various heuristics on performance, and based on this data, we recommend good values for design parameters. A performance improvement of up to 67% over oblivious simulation is observed for our benchmarks.
Appears in Collections:Cornell Theory Center Technical Reports

Files in This Item:

File Description SizeFormat
95-214.pdf266.71 kBAdobe PDFView/Open
95-214.ps394.48 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.


© 2014 Cornell University Library Contact Us