DocumentCode
1714383
Title
A new genetic algorithm for the channel routing problem
Author
Lienig, Jens ; Thulasiraman, K.
Author_Institution
Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada
fYear
1994
Firstpage
133
Lastpage
136
Abstract
A new genetic algorithm for channel routing in VLSI circuits is presented. It is based on a random path search in a lattice-like representation of the routing channel. The performance of the algorithm is tested on different benchmarks and it is shown that the results obtained using the proposed algorithm are either qualitatively similar to or better than the best published results
Keywords
VLSI; circuit layout CAD; genetic algorithms; integrated circuit technology; network routing; search problems; IC layout; VLSI circuits; channel routing problem; genetic algorithm; lattice-like representation; random path search; Benchmark testing; Circuit testing; Evolution (biology); Genetic algorithms; Genetic mutations; Joining processes; Pins; Q factor; Routing; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
VLSI Design, 1994., Proceedings of the Seventh International Conference on
Conference_Location
Calcutta
ISSN
1063-9667
Print_ISBN
0-8186-4990-9
Type
conf
DOI
10.1109/ICVD.1994.282671
Filename
282671
Link To Document