A Method of Realizing XOR/XNOR Gate using Symmetric Boolean Function Lattice Structure

 
 
 
  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract


    The current CMOS’s industry standard XOR and XNOR gate consist of 12 and 10 transistors respectively. This transistor count could be lowered down to produce low power circuits as XOR/XNOR are extensively used in many functional modules. As a solution, a method for realizing low transistor count XOR/XNOR gates using a special property of symmetric Boolean function is proposed. This property suggests that the circuits for such functions can be realized with fewer transistors using a special lattice structure circuit. Modifications are made to the original lattice structure to match with the current CMOS technology requirements. The final circuits require 8 transistors each for XOR/XNOR with mixtures of NMOS and PMOS at push-up and pull-down networks. Simulations show that the intended logic functions of XOR/XNOR are achieved. The reading of actual voltage swing, however, shows that the output is either 0.3V over ground or below VDD when there is a mixture of NMOS and PMOS as pull-down or push-up networks respectively. More voltage loss of 0.4V is observed if only NMOS is at push-up or only PMOS is at pull-down networks. As a preliminary work, this achievement of the functional logic level warrants more future work to improve the loss in output voltage swing.

     


  • Keywords


    XOR; XNOR; symmetric Boolean function; pass-transistor logic; CMOS; lattice structure.

  • References


      [1] R. L. Geiger, P. E. Allen, N. R. Strader, “VLSI Design Techniques for Analog and Digital Circuits,” McGraw-Hill, 1989.

      [2] Y. Cao, “Predictive Technology Model of Conventional CMOS Devices,” in Predictive Technology Model for Robust Nanoelectronic Design. Massachusetts: Springer, 2011, pp. 7-23.

      [3] M. Shoba, R. Nakkeeran, “GDI based full adders for energy efficient arithmetic applications,” Engineering Science and Technology, 2016, 19(1), 485-496.

      [4] S. R. C. Chowdhury, A. Banerjee, A. Roy, H. Saha, “A high Speed 8 Transistor Full Adder Design using Novel 3 Transistor XOR Gates,” International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering, 2(10), 2244-2250, 2008.

      [5] M. Vesterbacka, “A 14-Transistor CMOS Full Adder with Full Voltage-Swing Nodes,” Proceedings of the IEEE Workshop on Signal Processing Systems, 1999, pp. 713-722.

      [6] A. S. Mokhtar, M. F. Hasnan, M. Mustapha, N. Ismail, A. S. Ismail, N. G. N. Daud, “16 Bit Radix-8 Modified Booth Algorithm in FPGA,” Proceedings of the International Conference on Science, Technology and Social Sciences, 2018.

      [7] M. Mustapha, “Pattern Detection Approach to Boolean Function Classification,” Master Thesis, Multimedia University, 2004.

      [8] M. A. Harisson, “Introduction to Switching and Automata Theory,” McGraw Hill, 1965.

      [9] M. G. Priya, K. Baskaran, “Low Power Full Adder with Reduced Transistor Count,” International Journal of Engineering Trends and Technology, 4(5), 1755-1759, 2013.


 

View

Download

Article ID: 26061
 
DOI: 10.14419/ijet.v7i4.33.26061




Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.