Abstract
Quantum-dot cellular automata (QCA) is a new nanotechnology which facilitates computation paradigms with extremely low energy dissipation. In this paper, a novel efficient full adder–subtractor in QCA nanotechnology is proposed. First, one bit full adder with minimum delay cell is designed. Then the proposed full adder is used to design an efficient full adder–subtractor with minimum number of cells. The proposed circuit does not need any rotated cells and only uses one layer. Therefore, manufacturability of the design significantly improves. In addition, our design achieves 44 cell in full adder and only 83 cell in full adder–subtractor. The proposed full adder–subtractor only occupies 0.09 µm2 area.
Highlights
The size of CMOS transistors keep shrinking to increase the density on chip in accordance with Moore’s Law
To overcome the limitations of CMOS technology, quantum cellular automata (QCA) which is a solid-state nanoelectronic technology is developed as a possible alternative to conventional CMOS circuits [1]
The processing of data in a quantum cellular automata is based on a columbic transcription between similar cells
Summary
The size of CMOS transistors keep shrinking to increase the density on chip in accordance with Moore’s Law. Quantum dot cellular automata (QCA) technology is one such alternative, that can overcome the scaling issue and offer high frequency up to terahertz, high density, and low power consumption. To overcome the limitations of CMOS technology, quantum cellular automata (QCA) which is a solid-state nanoelectronic technology is developed as a possible alternative to conventional CMOS circuits [1]. The processing of data in a quantum cellular automata is based on a columbic transcription between similar cells. Each of these cells consists of four–six electron locations (quantum dot), which are connected to each other through tunneling junctions. As can be seen from (1) and (2), each full adder has two outputs (Sum and Carry) and the Sum output is the result of XOR of circuit inputs.
Sign-in/Register to view highlights & summary 
Published Version (
Free)
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 call