BDS: A BDD-Based Logic Optimization System (2000)
Cached
Download Links
- [www.sigda.org]
- [www.ecs.umass.edu]
- [www.ecs.umass.edu]
- [www-unix.ecs.umass.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | Proc. of DAC 2000 |
| Citations: | 43 - 0 self |
BibTeX
@INPROCEEDINGS{Yang00bds:a,
author = {Congguang Yang and Maciej Ciesielski and Vigyan Singhal},
title = {BDS: A BDD-Based Logic Optimization System},
booktitle = {Proc. of DAC 2000},
year = {2000},
pages = {92--97}
}
Years of Citing Articles
OpenURL
Abstract
This paper describes a new BDD-based logic optimization system, BDS. It is based on a recently developed theory for BDD-based logic decomposition, which supports both algebraic and Boolean factorization. New techniques, which are crucial to the manipulation of BDDs in a partitioned Boolean network environment, are described in detail. The experimental results show that BDS has a capability to handle very large circuits. It offers a superior runtime advantage over SIS, with comparable results in terms of circuit area and often improved delay.







