Copyright © 1990 Published by Elsevier Science Ltd.
Lee router modified for global routing
Received 25 August 1989;
revised 13 November 1989.
Available online 28 February 2003.
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







E-mail Article
Add to my Quick Links

Cited By in Scopus (2)





