By Topic

Efficient logic optimization using regularity extraction

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

1 Author(s)
Kutzschebauch, T. ; IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA

This paper presents a new method to extract functionally structures from logic netlists. It uses a fast regularity extraction algorithm based on structural equivalence. The goal of the proposed algorithm is the speedup of logic optimization of large circuits by reusing functionally equivalent structures of the design. It is particularly suited for circuits containing a large amount of datapaths. The regularity extraction algorithm uses an AND/XOR representation of the netlist to allow high correlation of functional and structural equivalence. It then extracts regular structures which can take any possible shape. The final optimization task is greatly reduced by optimizing only one copy of each regular structure while reusing the result for all other occurrences. In addition, structural regularity is widely preserved, resulting in higher packing density, shorter wiring length and improved delay during physical layout

Published in:

Computer Design, 2000. Proceedings. 2000 International Conference on

Date of Conference: