Premium
Design of efficient QCA multiplexers
Author(s) -
Cocorullo G.,
Corsonello P.,
Frustaci F.,
Perri S.
Publication year - 2016
Publication title -
international journal of circuit theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.364
H-Index - 52
eISSN - 1097-007X
pISSN - 0098-9886
DOI - 10.1002/cta.2096
Subject(s) - multiplexer , computer science , realization (probability) , block (permutation group theory) , multiplexing , cellular automaton , quantum dot cellular automaton , electronic engineering , function (biology) , logic gate , topology (electrical circuits) , algorithm , mathematics , engineering , electrical engineering , telecommunications , statistics , geometry , evolutionary biology , biology
Summary A new methodology to realize efficient multiplexers using quantum‐dot cellular automata (QCA) is presented in this paper. The novel designs here demonstrated fully exploit the intrinsic logic capabilities of the basic building block in the QCA domain: the Majority Gate. An efficient logic formulation is derived for the 4:1 multiplexing function that can be recursively applied to the realization of multiplexers with any fan‐in, by adding in the worst‐case path only one level of Majority Gate for each input doubling. A 16:1 multiplexer designed by applying the proposed recursive approach requires less than 1600 cells and consumes only 12 clock phases to complete the operation. Copyright © 2015 John Wiley & Sons, Ltd.