DocumentCode
3631488
Title
Routing in standard cells
Author
V. Litovski;Z. Randjelovic;M. Damnjanovic
Author_Institution
Fac. of Electron. Eng., Nis Univ., Serbia
Volume
2
fYear
1995
Firstpage
461
Abstract
A routing in standard cells is presented. It consists of a global and detailed routing. The problem of the global routing, aiming to minimize simultaneously wire length and density through routing regions, has been solved by a weighted Steiner tree. The detailed routing is considered as the problem of routing in a channel and in a switchbox. An advanced and enhanced greedy based algorithm for the channel routing is shown. For the switchbox routing problem an algorithm that minimizes congestion in the center of the routing region has been developed.
Keywords
"Routing","Wire","Delay","Wiring","Algorithm design and analysis","Pins","Very large scale integration","Hazards","Simulated annealing","Capacitance"
Publisher
ieee
Conference_Titel
Microelectronics, 1995. Proceedings., 1995 20th International Conference on
Print_ISBN
0-7803-2786-1
Type
conf
DOI
10.1109/ICMEL.1995.500910
Filename
500910
Link To Document