Graph-Based Transistor Network Generation Method for Supergate Design

Abstract

Optimizing transistor network represents an efficient way of improvising VLSI circuits. Existing optimization methods are not actually the most effective way to generate optimized network. The method of reducing only number of literals in a given Boolean expression does not actually reduce the transistor count. This paper proposes a graph-based method for minimizing the number of transistor count that compose a network. This proposed method can provide networks with minimum transistor count with irredundant sum-of-products expression as the input. Experimental results produced by the proposed method shows a substantial reduction in the number of transistor used in the networks.