DocumentCode :
275406
Title :
New placement and global routing algorithms for standard cell layouts
Author :
Edahiro, Masato ; Yoshimura, Takeshi
Author_Institution :
NEC Corp., Kawasaki, Japan
fYear :
1990
fDate :
24-28 Jun 1990
Firstpage :
642
Lastpage :
645
Abstract :
The placement algorithm, called the hierarchical clustering with min-cut exchange (HCME), is effective at avoiding being trapped in local optimum solutions. The global routing algorithm does not route the nets one by one and therefore the results are independent of the net order and channel order. In this algorithm, channel width is minimized under a cost function, in which the trade-off between the minimization of net-lengths and the minimization of the number of tracks is considered. These algorithms are simple and highly efficient. This is confirmed by computational experiments
Keywords :
circuit layout CAD; minimisation; channel width; global routing algorithms; hierarchical clustering with min-cut exchange; minimization; net-lengths; number of tracks; placement algorithm; standard cell layouts; Clustering algorithms; Cost function; Design automation; Minimization methods; National electric code; Quadratic programming; Routing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design Automation Conference, 1990. Proceedings., 27th ACM/IEEE
Conference_Location :
Orlando, FL
ISSN :
0738-100X
Print_ISBN :
0-89791-363-9
Type :
conf
DOI :
10.1109/DAC.1990.114932
Filename :
114932
Link To Document :
بازگشت