Implementation of coplanar approximate adders in QCA
B. Aravinth, L. Jegan Antony Marcilin · 2016
A approximate adder implemented with quantum-dot cellular automata (QCA) is described. The most basic arithmetic process is the adding of two binary digits, i.e. bits. In many fields the adder plays an important role but in most of the field the accuracy is not in concern. So proposed a novel approximate adder of quantum dot cellular automata (QCA).The proposed adder is used to reduce the circuit complexity and time delay with low error rate. The circuit complexity reduction is achieved by reducing the majority gate in the adder circuit. The operation of QCA circuits is simulated and verified using QCA Designer bistable vector simulation.