Title :
Minimum length linear transistor arrays in MOS
Author :
McMullen, Curtis T. ; Otten, Ralph H J M
Abstract :
The following abstract problem is solved: given a two-terminal series-parallel (sp) graph, find an sp-equivalent graph in which the number of vertices with odd degree is minimum, where an sp-equivalence class consists of the graphs with the same series and parallel connections except for their order. The motivation for this problem is to find a minimum-length one-dimensional transistor array for MOS-discharge networks.<>
Keywords :
MOS integrated circuits; equivalence classes; graph theory; linear integrated circuits; network topology; MOS-discharge networks; linear transistor arrays; minimum length array; series-parallel equivalent graph; Integrated circuit synthesis; Logic; MOS devices; MOSFETs; Minimization methods; Network synthesis; Voltage;
Conference_Titel :
Circuits and Systems, 1988., IEEE International Symposium on
Conference_Location :
Espoo, Finland
DOI :
10.1109/ISCAS.1988.15281
