Open AccessImproving logic function synthesis, through wire crossing reduction in quantum‐dot cellular automata layout
Author(s) -
Taherifard Mohammad,
Fathy Mahmood
Publication year - 2015
Publication title -
iet circuits, devices and systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.251
H-Index - 49
ISSN - 1751-8598
DOI - 10.1049/iet-cds.2014.0327
Subject(s) - quantum dot cellular automaton , cellular automaton , logic gate , computer science , heuristic , reduction (mathematics) , quantum gate , quantum dot , cmos , xor gate , function (biology) , and gate , quantum , algorithm , electronic engineering , materials science , mathematics , physics , nanotechnology , optoelectronics , quantum computer , engineering , quantum mechanics , geometry , artificial intelligence , evolutionary biology , biology
Quantum‐dot cellular automata, as the successor of metal–oxide semiconductor field‐effect transistors, are one of the promising nanotechnology devices, which have attracted myriad researchers in the recent decade. In this technology, coplanar wire crossing is one of the unique specifications that can reduce its reliability. In the present study, a heuristic method is introduced using the Karnaugh‐Map (K‐Map) to minimise the number of wire crossing as the first step. Afterwards, it attempts to replace each wire crossing with three non‐wire crossing XOR gates that reduce all wire crossings to zero as the second step. Experimental results reveal that, reducing wire crossings to zero, the authors method for 3‐variable functions lowers the number of gates about 54, 42, 58 and 59%, respectively, in comparison with K‐Map, Genetic, Gate‐Optimise and Universal Quantum‐dot Cellular Automata Logic Gate (UQCALG) methods. For 4‐variable functions, their method decreases the number of gates almost 64 and 58%, respectively.