[{“box”:0,”content”:”[if 992 equals=”Open Access”]n
n
Open Access
nn
n
n[/if 992]n
n
n
n
n
n
Vannala Sowmya, P. Sumithabhashini
n
- n t
n
n
n[/foreach]
n
n[if 2099 not_equal=”Yes”]n
- [foreach 286] [if 1175 not_equal=””]n t
- Student, Professor Department of Electronics and Communication Engineering, Holy Mary Institute of Technology and Science, Bogaram (v), Keesara, Department of Electronics and Communication Engineering, Holy Mary Institute of Technology and Science, Bogaram (v), Keesara Hyderabad, Hyderabad India, India
n[/if 1175][/foreach]
n[/if 2099][if 2099 equals=”Yes”][/if 2099]n
Abstract
nIn this article, we’ll take a look at a new kind of Full Adder (FA) design that mixes traditional Complementary Metal Oxide Semiconductors (CCMOS) with Pass Transistors (PTs) and Transmission Gates (TGs). To analyze the circuit’s performance, we used the Mentor Graphics software package. Since all twenty (20) varieties of Full Adder circuits were able to be measured and compared, this research was conducted. When the clock rate of the microprocessor’s ALU increases, FA efficiency must be enhanced. These results can be used to create state-of-the-art hybrid FAs with static CMOS logic, PTs, and TGs. Without the Cadence 45 nm toolkit, the FA would not exist. The reliability of the system was tested with twenty FA designs running from 0.4 V to 1.2 V. The proposed FA has been modified so that words of up to 64 bits in length may be used. The suggested FA is one of just six current systems that can continue operating at 64 bits without intermediate phase buffering. Results from simulations showing very low power usage and delay lend weight to the suggested architecture. The suggested hybrid FA circuit is a viable option for the data route design of contemporary high-performance CPUs, as shown by the simulation results. Using Mentor 16nm Technology, we successfully prototyped and tested a one-bit complete adder.
n
Keywords: FA, CCMOS, ALU, Microprocessor, CMOS, TGs, PTs
n[if 424 equals=”Regular Issue”][This article belongs to International Journal of VLSI Circuit Design & Technology(ijvcdt)]
n
n
n
n
n
nn[if 992 equals=”Open Access”] Full Text PDF Download[/if 992] n[if 992 not_equal=”Open Access”]
[/if 992]n[if 992 not_equal=”Open Access”] nnn[/if 992]nn[if 379 not_equal=””]n
Browse Figures
n
n[/if 379]n
References
n[if 1104 equals=””]n
- Frustaci, M. Lanuzza, P. Zicari, S. Perri and P. Corsonello, “Designing High-Speed Adders in Power-Constrained Environments,” IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 56, no. 2, pp. 172-176, Feb. 2009.
- Pal, Low Power VLSI Circuits and Systems, New Delhi, India: Springer India, 2015.
- Mohanty, “Efficient Fixed-Width Adder-Tree Design,” IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 66, no. 2, pp. 292-296, Feb. 2019.
- Purohit and M. Margala, “Investigating the impact of logic and circuit implementation for full adder performance,” IEEE Transactions on Very Large-Scale Integration (VLSI) Systems, vol. 20, no. 7, pp. 1327-1331, 2012.
- Zimmermann and W. Fichtner, “Low-power logic styles: CMOS versus pass-transistor logic,” IEEE J. Solid-State Circuits, vol. 32, no. 7, pp. 1079–1090, Jul. 1997.
- Yingtao Jiang, A. Al-Sheraidah, Yuke Wang, E. Sha and Jin-Gyun Chung, “A novel multiplexer-based low-power full adder,” IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 51, no. 7, pp. 345-348, July 2004.
- H. E. Weste and D. M. Harris, CMOS VLSI Design: A Circuits and Systems Perspective, 4th ed. Boston, MA, USA: Addison-Wesley, 2010.
- Shams, T.K. Darwish, and M. A. Bayoumi, “Performance analysis of low-power 1-bit CMOS full adder cells,” IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 10, no. 1, pp. 20–29, Feb. 2002.
- Chang, J. M. Gu, and M. Zhang, “A review of 0.18-μm full adder performances for tree structured arithmetic circuits,” IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 13, no. 6, pp. 686–695, Jun. 2005.
- Alioto, G. Di Cataldo, and G. Palumbo, “Mixed full adder topologies for high-performance low-power arithmetic circuits,” Microelectron. J., vol. 38, no. 1, pp. 130–139, Jan. 2007, Elsevier.
- -K. Tung, Y.-C. Hung, S.-H. Shieh, and G.-S. Huang, “A low-power high-speed hybrid CMOS full adder for embedded system,” in Proc. IEEE Conf. Design Diagnostics Electron. Circuits Syst., vol. 13. Apr. 2007, pp. 1–4.
- Vesterbacka, “A 14-transistor CMOS full adder with full voltageswing nodes,” in Proc. IEEE Workshop Signal Process. Syst. (SiPS), Taipei, Taiwan, Oct. 1999, pp. 713–722.
- T. Bui, Y. Wang, and Y. Jiang, “Design and analysis of low-power 10-transistor full adders using novel XOR-XNOR gates,” IEEE Transactions on Circuits Systems II: Express Briefs, vol. 49, no. 1, pp. 25–30, Jan. 2002.
- Zhang, J. Gu, and C.-H. Chang, “A novel hybrid pass logic with static CMOS output drive full-adder cell,” in Proc. Int. Symp. Circuits Syst., May 2003, pp. 317–320.
- Aguirre-Hernandez and M. Linares-Aranda, “CMOS full-adders for energy-efficient arithmetic applications,” IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 19, no. 4, pp. 718–721, Apr. 2011.
- Hassoune, D. Flandre, I. O’Connor and J. Legat, “ULPFA: A New Efficient Design of a Power-Aware Full Adder,” in IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 57, no. 8, pp. 2066- 2074, Aug. 2010.
- Bhattacharyya, B. Kundu, S. Ghosh, V. Kumar, and A. Dandapat, “Performance Analysis of a Low-Power High-Speed Hybrid 1-bit Full Adder Circuit,” IEEE Transactions on Very Large-Scale Integration (VLSI) Systems, vol. 23, no. 10, pp. 2001-2008, Oct. 2015.
- C. Parameshwara and H. C. Srinivasaiah, “Low-Power Hybrid 1-Bit Full Adder Circuit for Energy Efficient Arithmetic Applications,” Journal of Circuits, Systems and Computers, vol. 26, no. 1, pp. 1-15, 2017.
- M Shoba, R Nakkeeran, “GDI based full adders for energy efficient arithmetic applications”, Engineering Science and Technology, an International Journal 19, Elsevier, pp. 485–496, 2016
- Pan and A. Naeemi, “A Paradigm Shift in Local Interconnect Technology in the Era of Nanoscale Multigate and Gate-All-Around Devices,” vol. 36, no. 3, pp. 274-276, 2015.
nn[/if 1104][if 1104 not_equal=””]n
- [foreach 1102]n t
- [if 1106 equals=””], [/if 1106][if 1106 not_equal=””],[/if 1106]
n[/foreach]
n[/if 1104]
nn
nn[if 1114 equals=”Yes”]n
n[/if 1114]
n
n
n
International Journal of VLSI Circuit Design & Technology
n
n
n
n
n
n
| Volume | 01 | |
| [if 424 equals=”Regular Issue”]Issue[/if 424][if 424 equals=”Special Issue”]Special Issue[/if 424] [if 424 equals=”Conference”][/if 424] | 02 | |
| Received | December 16, 2023 | |
| Accepted | January 3, 2024 | |
| Published | January 12, 2024 |
n
n
n
n
n
n function myFunction2() {n var x = document.getElementById(“browsefigure”);n if (x.style.display === “block”) {n x.style.display = “none”;n }n else { x.style.display = “Block”; }n }n document.querySelector(“.prevBtn”).addEventListener(“click”, () => {n changeSlides(-1);n });n document.querySelector(“.nextBtn”).addEventListener(“click”, () => {n changeSlides(1);n });n var slideIndex = 1;n showSlides(slideIndex);n function changeSlides(n) {n showSlides((slideIndex += n));n }n function currentSlide(n) {n showSlides((slideIndex = n));n }n function showSlides(n) {n var i;n var slides = document.getElementsByClassName(“Slide”);n var dots = document.getElementsByClassName(“Navdot”);n if (n > slides.length) { slideIndex = 1; }n if (n (item.style.display = “none”));n Array.from(dots).forEach(n item => (item.className = item.className.replace(” selected”, “”))n );n slides[slideIndex – 1].style.display = “block”;n dots[slideIndex – 1].className += ” selected”;n }n”}]