By Topic

Boolean technology mapping based on logic decomposition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. Damiani ; Sierra Design Autom., Santa Clara, CA, USA ; A. Y. Selchenko

The decomposition tree of a logic function first appears in the work of Ashenhurst (Proc. Int. Symp. Theory of Switching, p.74-116, 1957). It is a canonical, treelike logic network representing the decomposition properties of that function. We present an algorithm for technology mapping based on the use of such trees for the representation of library elements. Decomposition information is also embedded in the representation of leaf-dags of the subject graph. Because library functions are represented by trees, this approach allows us to combine Boolean matching with efficient tree-based matching algorithms. In this way, Boolean matching can now be used not only for incremental optimization, but also for building the initial mapping "from scratch". Finally, we remark that by combining this method with the one of Lehman et al (IEEE Trans. on CAD/ICAS, vol.16(8), p.813-834, 1997), we are able to represent implicitly a search space of unprecedented size for a subject graph. The algorithm has been implemented in C++ in a prototype mapper, VERSE, and tested on several common synthesis benchmarks.

Published in:

Integrated Circuits and Systems Design, 2003. SBCCI 2003. Proceedings. 16th Symposium on

Date of Conference:

8-11 Sept. 2003