Optimum Gate Ordering of CMOS Logic Gates using Euler Path Approach: Some Insights and Explanations

Kuntal Roy

Abstract


The paper addresses some insights into the Euler path approach to find out the optimum gate ordering of CMOS logic gates. Minimization of circuit layout area is one of the fundamental considerations in circuit layout synthesis. Euler path approach suggests that finding a common Euler path in both NMOS and PMOS network minimizes the logic gate layout area. In this article, the minimization of layout area has been placed as equivalent to minimization of the total number of odd vertices in NMOS and PMOS networks. It has been logically proved that a MOS network will always have an even number of odd vertices. Moreover, it intuitively explains how to organize the sequence of NMOS network when deriving PMOS network from it, so that the total number of odd vertices is minimized. The algorithm to determine the total number of optimized solutions is also presented in this paper.

Full Text:

PDF


DOI: http://dx.doi.org/10.2498/cit.1000731

Creative Commons License
This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.

Crossref Similarity Check logo

Crossref logologo_doaj