Minimal majority gate mapping of 4-variable functions for quantum cellular automata
Peng Wang, Mohammed Y. Niamat, Srikanth Vemuru · 2011
Three-input majority gates and inverters form the basic Boolean primitive logic blocks of quantum cellular automata (QCA) circuits. Ideally, an optimized QCA design should have minimal number of gate counts and logic levels. However, existing majority gate logic synthesis methods based on three-feasible networks often result in inefficient use of majority logic gates. In this paper, we propose an improved majority gate logic synthesis technique and present a total of 143 four-variable standard functions and their majority gate implementations. These functions can be incorporated in the majority gate synthesis tools giving more efficient logic implementations. For the 13 MCNC benchmarks presented in this paper, the proposed approach yields a combined reduction of 16.2% in the number of gate counts and 5.21% in the number of levels when compared with the existing method.