By Topic

A fast and efficient algorithm for determining fanout trees in large networks

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

2 Author(s)
Shen Lin ; Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA ; Marek-Sadowska, M.

The authors present a heuristic algorithm the optimal selection of the fanout tree structures in VLSI circuit design. The algorithm minimizes area of the added buffers under the specified timing constraints. The algorithms described in the literatures solve a simpler problem of minimizing the circuit's timing without taking into account the area increase introduced by the buffers. Experimental results demonstrate that the authors' approach is very fast and efficient, particularly for large examples whose solution spaces are very large

Published in:

Design Automation. EDAC., Proceedings of the European Conference on

Date of Conference:

25-28 Feb 1991