Transistor network optimization represents an effective way of improving VLSI circuits. This paper proposes a novel method to automatically generate networks with minimal transistor count, starting from an irredundant sum-of-products expression as the input. The method is able to deliver both series-parallel (SP) and non-SP switch arrangements, improving speed, power dissipation, and area of CMOS gates. Experimental results demonstrate expected gains in comparison with related approaches.
This paper shows that double gate devices, like independent-gate (IG) FinFETs, have introduced new challenges in the transistor network generation step during the logic synthesis. The main point is that reducing the number of literals in a given Boolean expression is not enough to guarantee a minimum IG FinFET network implementation. This way, traditional factorization methods or graph-based optimizations may not be useful to generate networks for double gate devices. In this sense, this paper presents a graph-based method able to find promising arrangements to explore the separated gates of each IG FinFET. The experiments demonstrate that the proposed method can reduce the number of IG FinFETs compared to the traditional methods of transistor network generation.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.