Logic optimization for majority gate-based nanoelectronic circuits

In this paper, an efficient majority logic optimizer is proposed to synthesize majority gate-based nanoelectronic circuits. A novel sharing and mapping scheme is proposed to achieve simple synthesized circuits and high synthesis speed. The experimental results show that compared to the existing method, the proposed method achieves up to 20% reduction of gate counts and 25% higher synthesis speed. This proposed optimizer can be widely used in quantum cellular automata, tunneling phase logic, and single electron tunneling circuit design

[1]  T. J. Fountain,et al.  A memory design in QCAs using the SQUARES formalism , 1999, Proceedings Ninth Great Lakes Symposium on VLSI.

[2]  Rui Zhang,et al.  Synthesis of majority and minority networks and its applications to QCA, TPL and SET based nanotechnologies , 2005, 18th International Conference on VLSI Design held jointly with 4th International Conference on Embedded Systems Design.

[3]  Robert K. Brayton,et al.  Sequential circuit design using synthesis and optimization , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[4]  Sheldon B. Akers,et al.  Synthesis of combinational logic using three-input majority gates , 1962, SWCT.

[5]  Niraj K. Jha,et al.  Threshold network synthesis and optimization and its application to nanotechnologies , 2005 .

[6]  John Lach,et al.  Modeling QCA for area minimization in logic synthesis , 2003, GLSVLSI '03.

[7]  G.A. Jullien,et al.  A method of majority logic reduction for quantum cellular automata , 2004, IEEE Transactions on Nanotechnology.

[8]  Michael T. Niemier,et al.  A design of and design tools for a novel quantum dot based microprocessor , 2000, Proceedings 37th Design Automation Conference.