ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Computer-Aided Design
Volume 22, Issue 5, June 1990, Pages 296-300
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (349 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
Special issue
View Record in Scopus
 
doi:10.1016/0010-4485(90)90094-S    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1990 Published by Elsevier Science Ltd.

Lee router modified for global routing

A. D. Brown and M. Zwolinski

Electronics Department, University of Southampton, Southampton SO0 5NH, Hants, UK

Received 25 August 1989; 
revised 13 November 1989. 
Available online 28 February 2003.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

The Lee routing algorithm is one of the earliest routing algorithms, and has been widely used and analysed for most aspects of automated wiring. The paper contains details of yet another modification to the basic algorithm that attempts to keep the average wiring density even over a large chip. Despite the large amount that has been published on the Lee algorithm, this particular adaptation has not been reported before. It is shown that the modification described can decrease the standard deviation of the channel wiring density by 25%.

Author Keywords: computer-aided design; electronic design automation; routing

Article Outline

• References

Computer-Aided Design
Volume 22, Issue 5, June 1990, Pages 296-300
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.