Cart (Loading....) | Create Account
Close category search window
 

TROY: a tree based approach to logic synthesis and technology mapping

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
$31 $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

3 Author(s)
Noth, W. ; Lehrstuhl fur Tech. Inf., Wurzburg Univ., Germany ; Hinsberger, U. ; Kolla, R.

In this paper we present a new approach to the synthesis of combinational circuits and the mapping of standard gates like NAND, NOR, AOI and OAI with arbitrary number of inputs. Our method is based on the provable optimal synthesis of the fan-out-free regions of a circuit, represented as normal AND-OR-trees. Normal AND-OR-trees enable TROY to rebalance the regions with respect to delay without loosing area and lead to a much larger search space than that used by tree matching. Fast heuristics derived from the optimal approach yield significantly faster results than SIS on many standard benchmark circuits

Published in:

VLSI, 1996. Proceedings., Sixth Great Lakes Symposium on

Date of Conference:

22-23 Mar 1996

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.