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 are 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.
Original language | English |
---|---|
Title of host publication | 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers |
Publisher | Publ by IEEE |
Pages | 492-495 |
Number of pages | 4 |
ISBN (Print) | 0818620552 |
Publication status | Published - 1990 |
Event | 1990 IEEE International Conference on Computer-Aided Design - ICCAD-90 - Santa Clara, CA, USA Duration: 1990 Nov 11 → 1990 Nov 15 |
Other
Other | 1990 IEEE International Conference on Computer-Aided Design - ICCAD-90 |
---|---|
City | Santa Clara, CA, USA |
Period | 90-11-11 → 90-11-15 |
All Science Journal Classification (ASJC) codes
- General Engineering