Close category search window
 

A "Grid-free" Channel Router

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

5 Author(s)
Sato, K. ; LSI Development Laboratory Mitsubishi Electric Corporation, Hyogo, Japan ; Shimoyama, H. ; Nagai, T. ; Ozaki, M.
more authors

A "grid-free" channel router (termed GFR) is reported. GFR does not employ grid lines and can obtain better results than the fixed-grid method. Additionally, GFR has several optional functions, such as "constraint loop breaking", "total branch length minimization", "constraint chain cutting" and "layer changing". The algorithms of these functions are outlined and results obtained by using them are presented.

Published in:
Design Automation, 1980. 17th Conference on

Date of Conference: 23-25 June 1980

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.