Implementation of Boolean Expressions Using Shannon’s Theorem in Quantum-dot Cellular Automata
نویسندگان
چکیده
منابع مشابه
Exploring and Exploiting Quantum-Dot Cellular Automata
The Full Adders (FAs) constitute the essential elements of digital systems, in a sense that they affect the circuit parameters of such systems. With respect to the MOSFET restrictions, its replacement by new devices and technologies is inevitable. QCA is one of the accomplishments in nanotechnology nominated as the candidate for MOSFET replacement. In this article 4 new layouts are presente...
متن کاملFault-tolerant adder design in quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for faster speed, smaller size, and low power consumption than semiconductor transistor based technologies. Previously, adder designs based on conventional designs were examined for implementation with QCA technology. This paper utilizes the QCA characteristics to design a fault-tolerant adder that is more...
متن کاملDesign of Optimized Quantum-dot Cellular Automata RS Flip Flops
Complementary metal-oxide semiconductor (CMOS) technology has been the industry standard to implement Very Large Scale Integrated (VLSI) devices for the last two decades. Due to the consequences of miniaturization of such devices (i.e. increasing switching speeds, increasing complexity and decreasing power consumption), it is essential to replace them with a new technology. Quantum-dot c...
متن کاملFault-tolerant adder design in quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for faster speed, smaller size, and low power consumption than semiconductor transistor based technologies. Previously, adder designs based on conventional designs were examined for implementation with QCA technology. This paper utilizes the QCA characteristics to design a fault-tolerant adder that is more...
متن کاملImplementation of Comparison Function Using Quantum-Dot Cellular Automata
A comparison function is important to implement arbitrary large Boolean functions. In this paper we show that a comparison function can be directly and efficiently 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 inp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Sciences
سال: 2012
ISSN: 1812-5654
DOI: 10.3923/jas.2012.1696.1700