Generation of Layouts from Circuit Schematics; A Graph Theoretic Approach2
1984 (English)Conference paper (Refereed)
A graph model is proposed to capture the topological properties of metal-oxide semiconductor (MOS) transistors and interconnections among transistors. A set of algorithms is devised for the enumeration of layout topologies of a circuit from its graph model. Layout topologies are presented in stick diagrams. The algorithms select a set of embedded layout topologies with the “fewest” number of jumpers for layout generation and compaction. Layouts for circuits with up to 36 transistors have been generated successfully. The layouts corresponding to the topologies generated and selected by the algorithms are, in most cases, smaller than compact hand layouts. The worst case computational complexity is O(n 2), where n is the number of transistors in the circuit.
Place, publisher, year, edition, pages
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-65756DOI: 10.1145/317825.317831OAI: oai:DiVA.org:kth-65756DiVA: diva2:483648
The 1985 Design Automation Conference
NR 201408052012-01-252012-01-25Bibliographically approved