A new method for assigning signal flow directions to MOS transistors

Author

Lee, K.-J. ; Gupta, R. ; Breuer, M.A.

Author_Institution

Dept. of Electr. Eng.-Syst., Univ. of Southern California, Los Angeles, CA, USA

fYear

1990

fDate

11-15 Nov. 1990

Firstpage

492

Lastpage

495

Abstract

Signal flow directions of MOS transistors have been used in many CAD tools. A graph theoretic approach is presented for determining these directions. A MOS circuit is represented using several undirected graphs called ST-graphs. The direction assignment problem is modeled as a two paths problem in each ST-graph. Necessary and sufficient conditions under which all edges in an ST-graph are unidirectional are derived. A linear time algorithm is presented that assigns directions to all edges in an ST-graph if they all unidirectional. If bidirectional edges exist, the algorithm assigns directions to most edges in the ST-graph, and the remaining edges are resolved by a sequence of additional algorithms. Experimental results validate the performance benefits of this approach.<>

Keywords

circuit CAD; graph theory; insulated gate field effect transistors; CAD tools; MOS transistors; ST-graphs; graph theoretic approach; linear time algorithm; signal flow directions; undirected graphs; Capacitance; Circuits; Computational modeling; Design automation; MOSFETs; Signal analysis; Signal resolution; Sufficient conditions; Timing; Transistors;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer-Aided Design, 1990. ICCAD-90. Digest of Technical Papers., 1990 IEEE International Conference on

Conference_Location

Santa Clara, CA, USA

Print_ISBN

0-8186-2055-2

Type

conf

DOI

10.1109/ICCAD.1990.129962

Filename

129962