Abstract
Quantum-dot Cellular Automata (QCA) based on majority logic is a promising technology for implementation of future integrated circuits. However, the current majority logic synthesis approaches based on three-feasible networks often lead to inefficient QCA circuit implementations. In this work, four-feasible networks are used as the starting point; therefore each node in the network can accommodate one extra variable. Using the Nauty algorithm, 222 standard functions along with their majority gate mapping are identified for Boolean logic functions with up to four-variables. In addition, all redundancies in the synthesized results are eliminated to reduce the size of the QCA circuit implementations. The proposed method leads to an average reduction of 7.94 % in terms of levels of logic and 8.13 % in terms of gates for the 24 Microelectronics Center of North Carolina (MCNC) benchmarks as compared to other methods.KeywordsMajority logic synthesisQuantum-dot cellular automata (QCA)Nauty algorithm
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
