BDS: a BDD-based logic optimization system

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 h,mdle very large circuits. It offers a superior runtime advantage over SE, with comparable results in terms of circuit area and often improved delay.