Circuit design based on majority gates for applications with quantum-dot cellular automata

Majority gate-based logic is not normally explored with standard CMOS technologies, primarily because of the hardware inefficiencies in creating majority gates. As a result, not much effort has been made towards the optimization of circuits based on majority gates. We are exploring one particular emerging technology, quantum-dot cellular automata (QCA), in which the majority gate is the fundamental logic primitive. We report a simple and intuitive method for reduction of three-variable Boolean functions into a simplified majority representation. The method is based on Karnaugh maps (K-maps), used for the simplification of Boolean functions.