DocumentCode
3039724
Title
Placement algorithms for CMOS cell synthesis
Author
Hill, Dwight D. ; Aranha, Mario A. ; Shugard, Donald D.
Author_Institution
AT&T Bell Lab., Murray Hill, NJ, USA
fYear
1990
fDate
17-19 Sep 1990
Firstpage
454
Lastpage
458
Abstract
Heuristic placement algorithms for the layout synthesis of CMOS logic cells are described. The techniques are not restricted to fully complimentary CMOS, and focus on a novel strategy for FET pair ordering which takes advantage of splitting wide FETs to eliminate diffusion gaps. These algorithms are applicable to strip-based layout synthesis from transistor netlists. Existing CMOS cell synthesis systems neither fully include the costs nor utilize the benefits of FET splitting. The system described does this, in some cases results in an area saving. In general, it trades diffusion gaps for useful FETs. Since some technologies penalize diffusion gaps heavily, and others, such as sea-of-gates, forbid them altogether, such a tradeoff seems increasingly appropriate
Keywords
CMOS integrated circuits; circuit layout CAD; heuristic programming; logic CAD; CMOS cell synthesis; FET pair ordering; diffusion gaps; heuristic placement algorithms; logic cells; sea-of-gates; strip-based layout synthesis; transistor netlists; CMOS logic circuits; CMOS technology; FETs; Heuristic algorithms; MOS devices; Partitioning algorithms; Routing; Silicon; Strips; Timing;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Design: VLSI in Computers and Processors, 1990. ICCD '90. Proceedings, 1990 IEEE International Conference on
Conference_Location
Cambridge, MA
Print_ISBN
0-8186-2079-X
Type
conf
DOI
10.1109/ICCD.1990.130277
Filename
130277
Link To Document