DocumentCode
2470813
Title
An efficient heuristic approach on minimizing the number of feedthrough cells in standard cell placement
Author
Yan, Jin-Tai
Author_Institution
Dept. of Comput. & Inf. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan
fYear
1995
fDate
16-18 Mar 1995
Firstpage
128
Lastpage
131
Abstract
Standard cell design style has been widely applied for the design automation of VLSI circuits because of the easy implementation of the layout design. Since the aim of most standard cell design systems is to minimize the utilization of chip area, the number of feedthrough cells in a standard cell layout will be further minimized to reduce the layout size. In this paper, first, we model a row assignment problem to minimize the number of feedthrough cells in a standard cell placement. Furthermore, an efficient heuristic approach is proposed to minimize the number of feedthrough cells in standard cell placement. The time complexity of the heuristic approach is further proved to be in O(|E|log|E|) time, where |E| is the number of edges in a separation graph. Finally, two standard cell benchmarks, Primary1 and Primary2, have been tested on the proposed approach for the assignment of different number of rows
Keywords
VLSI; cellular arrays; circuit layout CAD; circuit optimisation; computational complexity; integrated circuit layout; logic CAD; logic partitioning; Primary1; Primary2; VLSI circuits; chip area; design automation; feedthrough cells; heuristic approach; layout design; layout size; row assignment problem; separation graph; standard cell benchmarks; standard cell placement; time complexity; Benchmark testing; Circuits; Clustering algorithms; Design automation; Heuristic algorithms; Information science; Partitioning algorithms; Pins; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
VLSI, 1995. Proceedings., Fifth Great Lakes Symposium on
Conference_Location
Buffalo, NY
ISSN
1066-1395
Print_ISBN
0-8186-7035-5
Type
conf
DOI
10.1109/GLSV.1995.516038
Filename
516038
Link To Document