Fast Compiled Logic Simulation Using Linear BDDs
| dc.contributor.author | Gupta, Sudeep | en_US |
| dc.contributor.author | Pingali, Keshav | en_US |
| dc.date.accessioned | 2007-04-23T18:02:50Z | |
| dc.date.available | 2007-04-23T18:02:50Z | |
| dc.date.issued | 1995-06 | en_US |
| dc.description.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-free regions (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 some of the advantages of oblivious as well as demand-driven evaluation. We investigated the impact of 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. | en_US |
| dc.format.extent | 273112 bytes | |
| dc.format.extent | 403947 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR95-1522 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7179 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Fast Compiled Logic Simulation Using Linear BDDs | en_US |
| dc.type | technical report | en_US |