ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

An extended evolutionary programming algorithm for VLSI channel routing

Rao, Prahlada BB and Patnaik, LM and Hansdah, RC (1995) An extended evolutionary programming algorithm for VLSI channel routing. In: Fourth Annual Conference on Evolutionary Programming, 1-3 March 1995, San Diego, CA, USA, pp. 521-544.

Full text not available from this repository. (Request a copy)
Official URL: http://www.arnetminer.org/viewpub.do?pid=182678


Channel routing is an important part of circuit layout in VLSI design. This paper presents an evolutionary programming-based two-layer channel router (EPCHR) that uses an integer representation. Adaptive mutation, solution refinement, and relabeling schemes are proposed. The combination of these schemes reduces the number of generations required to find the global optimum solution of a channel routing problem. EPCHR is demonstrated on six standard benchmark problems.

Item Type: Conference Paper
Publisher: MIT Press
Additional Information: Copyright of this article belongs to MIT Press.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 14 Sep 2007
Last Modified: 11 Jan 2012 05:28
URI: http://eprints.iisc.ac.in/id/eprint/10909

Actions (login required)

View Item View Item