Synthesis of symmetric functions using quantum cellular automata

This work presents a synthesis technique for implementing totally symmetric Boolean functions around quantum-dot cellular automata (QCA). The basic units of the design are the majority voter (majority gates) and and-or-inverter (AOI). The synthesis of a unate symmetric function is realized with majority gates only. Whereas, the general symmetric functions are realized, following the unate decomposition method, with AOI. The efficiency of proposed synthesis technique is compared with that of conventional CMOS-based designs. The simulation of benchmark functions confirms that the proposed technique results in better designs than that of CMOS based designs