Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29734


Select areas to restrict search in scientific publication database:
6897
Two New Low Power High Performance Full Adders with Minimum Gates
Abstract:
with increasing circuits- complexity and demand to use portable devices, power consumption is one of the most important parameters these days. Full adders are the basic block of many circuits. Therefore reducing power consumption in full adders is very important in low power circuits. One of the most powerconsuming modules in full adders is XOR/XNOR circuit. This paper presents two new full adders based on two new logic approaches. The proposed logic approaches use one XOR or XNOR gate to implement a full adder cell. Therefore, delay and power will be decreased. Using two new approaches and two XOR and XNOR gates, two new full adders have been implemented in this paper. Simulations are carried out by HSPICE in 0.18μm bulk technology with 1.8V supply voltage. The results show that the ten-transistors proposed full adder has 12% less power consumption and is 5% faster in comparison to MB12T full adder. 9T is more efficient in area and is 24% better than similar 10T full adder in term of power consumption. The main drawback of the proposed circuits is output threshold loss problem.
Digital Object Identifier (DOI):

References:

[1] M. W. Elgharbawy, M. A. Bayoumi, "Leakge Sources and Possible Solutions in Nanometer CMOS Technology," IEEE circuit and system magazine, pp. 6-16, 2005.
[2] H. T. Bui, Y. Wang, and Y. Jiang, "Design and Analysis of 10- Transistor Full Adders Using XOR-XNOR Gates," IEEE Trans. Circuits and Syst. II, Analog Digit. Signal Process., vol 49, no. 1, pp. 25-30, Jan. 2002.
[3] A. Kumar, M. A. Bayoumi, "Design of Robust Energy Efficient Full Adders for Deep-Submicrometer Design Using Hybrid-CMOS Logic Style," IEEE Trans. VLSI, vol. 14, no. 12, Dec. 2006.
[4] T. Lynch, E. Swartzlander, "A Spanning Tree Carry Lookahead Adder," IEEE Trans. Comput. vol 41, pp 931-939, Aug. 1992.
[5] R.Shalem, E. John, and L. K. John, "A Novel Low-Power Energy Recovery Full Adder Cell," in proc. of GLSVLSI, pp 380-383, 1999.
[6] K. Navi, M. Maeen, V. Foroutan, S. Timarchi, and O. Kavei, "A Novel Low Power Full-Adder Cell for Low Voltage," Integration the VLSI Journal, 2009.
[7] M. A. Elgamel, S. Goel, and M. a. Bayoumi, "Noise Tolerant Low Voltage XOR-XNOR For Fast Arithmetic," GLSVLSI, 2003.
[8] N. Zhuang, H. Wu, "A New Design of CMOS Full Adder," IEEE Journal of Solid-State Circuits, vol. 27, no. 5, pp. 840-844, May 1992.
[9] N. West, K. Eshraghian, Principles of CMOS VLSI Design, system prospective reading, MA: Addison-Wesley, 1993.
[10] A. M. shams, M. A. Bayoumi, "A Novel High Performance CMOS 1-Bit Full Adder Cell," IEEE Trans. Circuits and Systems II: Analog digital Signal Process. 47 (2000), vol. 47, no. 5, May 2000.
[11] H. T. Bui, Y. Wang, and Y. Jiang, "Design and Analysis of Low Power 10-T Full Adders Using Novel XOR-XNOR Gates," IEEE Trans. On Circuits and Systems II: Analog and Digital signal process. vol. 49, no. 1, Jan. 2002.
[12] S. Goel, A, Kumar, M. A. Bayoumi, "Design of Robust, Energy- Efficient Full Adders for Deep-Submicrometer Design Using Hybrid- CMOS Logic Style," IEEE Trans. on VLSI Systems, vol. 14, no. 12, Dec. 2006.
[13] Y. Jiang, A. Alsheridah, Y. Wang, E. shah, and J. Chung, "A Novel Multiplexer-Based Low Power Full Adder," IEEE Trans. On Circuits and Systems, vol. 51, no. 7, Jul. 2004.
[14] S. Veeramachaneni, M. B. Sirinivas, "New Improved 1-Bit Full Adder Cells," CCECE/CGEI, Canada, 2008.
[15] A. Elgamel, S. Goel, and M. A. Bayoumi, "Noise Tolerant Low Voltage XOR-XNOR for Fast Arithmetic," GLSVLSI, Washington D.C., 2003.
Vol:13 No:06 2019Vol:13 No:05 2019Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007