Implementation of Comparison Function Using Quantum-Dot Cellular Automata
Meghanad D. Wagh, Yichun Sun, Viswanath Annampedu · TechConnect Briefs · 2008
A comparison function is important to implement arbitrary large Boolean functions. In this paper we show that a comparison function can be directly and eciently implemented using QCA. The resultant architecture of an n bit comparator has a delay of dlog2ne+1 and a complexity of O(n) gates. By duplicating certain majority gates, all crossing wires in the implementation except those at the input level can be eliminated.