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

High performance over-the-cell routing

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)
Crenshaw, J.E. ; Dept. of Comput. Sci., Southern Illinois Univ., Carbondale, IL, USA ; Tragoudas, S. ; Sherwani, N.A.

Recently, several algorithms have been presented which use over-the-cell routing to minimize channel height in standard cell designs. A major shortcoming of the existing routers is the increase in the maximum wire length which may violate the timing constraints. In this paper, we consider the center terminal model, and the terminal assignment phase for over-the-cell routing so that the timing overhead of the routing meets a certain bound. We guarantee efficient terminal assignment by minimizing the maximum net span, a lower bound for the timing overhead, formally defined as the maximum Manhattan distance, among all nets, between the source and furthest destination on the net. We present an O(t2·logt) optimal dynamic programming algorithm for the maximum net span, and an efficient heuristic that couples net span and density minimization so that we obtain high performance routing with small channel width. Experimental results support the theoretical foundations of our approach

Published in:

VLSI Design, 1994., Proceedings of the Seventh International Conference on

Date of Conference:

5-8 Jan 1994

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.