| 1/2024 - 8 |
Efficient and Power-Aware Design of a Novel Sparse Kogge-Stone Adder using Hybrid Carry Prefix Generator AdderKHAN, A.   , WAIRYA, S. |
View the paper record and citations in  |
| Click to see author's profile in SCOPUS, IEEE Xplore, Web of Science |
Download PDF  (1,721 KB) | Citation | Downloads: 260 | Views: 173 |
Author keywords
circuit simulation, circuit topology, digital circuits, parallel architectures, very large scale integration
References keywords
adder(20), systems(12), carry(12), high(11), design(11), adders(11), speed(9), circuits(8), prefix(7), parallel(7)
Blue keywords are present in both the references section and the paper title.
About this article
Date of Publication: 2024-02-29
Volume 24, Issue 1, Year 2024, On page(s): 71 - 80
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2024.01008
SCOPUS ID: 85189442408
Abstract
This paper presents a novel Sparse Kogge-Stone adder architecture with a sparsity factor of 2, offering a compelling solution to the challenges faced by parallel prefix adders. The superior performance is achieved by including the hybrid carry prefix generator adder (HCPGA), which leads to the elimination of redundant components, and improvements in power consumption and circuit area without compromising computation speed. The proposed hybrid architecture efficiently generates carry prefixes that negates the need for the conventional generate and propagate block, resulting in reduced computational complexity. The effectiveness of the proposed architecture has been extensively validated using Cadence Virtuoso in the 45nm technology node. In addition to evaluating standard performance parameters such as power, delay, and area, comprehensive Monte Carlo simulations and process corner analyses have been performed to ensure the robustness and reliability of the design. Furthermore, the practical application of the proposed architecture has been demonstrated by integrating it into a digital multiplier architecture, showcasing its potential to enhance the computational capabilities of complex arithmetic circuits. This research contributes to the advancement of efficient adder designs for high-performance computing applications, making it highly beneficial and relevant for modern digital circuit designs. |
| References | | | Cited By «-- Click to see who has cited this paper |
| [1] D. A. Patterson and J. L. Hennessy, "Computer organization and design ARM edition: the hardware software interface," Morgan Kaufmann, 2016
[2] R. G. Lyons, "Streamlining digital signal processing," Wiley, New Jersey, 2012 [3] B. Mohanty, S. Patel, "Area-delay-power efficient carry-select adder," IEEE Transactions on Circuits and Systems. II, vol. 61, no. 6, p. 418-422, 2014. [CrossRef] [Web of Science Times Cited 65] [SCOPUS Times Cited 130] [4] M. Hasan, M. S. Hossain, A. H. Siddique, M. Hossain, H. U. Zaman, and S. Islam, "A high-speed 4-bit carry look-ahead architecture as a building block for wide word-length carry-select adder," Microelectronics Journal, vol. 109, p. 104992, 2021. [CrossRef] [Web of Science Times Cited 10] [SCOPUS Times Cited 21] [5] A. Khan, A. Chakraborty, U. B. Joy, S. Wairya, and M. Hasan, "Carry look-ahead and ripple carry method based 4-bit carry generator circuit for implementing wide-word length adder," Microelectronics Journal, vol. 140, p. 105949, 2023. [CrossRef] [Web of Science Times Cited 1] [6] S. Held and S. Spirkl, "Fast prefix adders for non-uniform input arrival times," Algorithmica, vol. 77, no. 1, p. 287-308, 2015. [CrossRef] [Web of Science Times Cited 8] [SCOPUS Times Cited 9] [7] A. Abinaya and M. Maheswari, "Implementation of kogge stone adder for signal processing applications," International Journal of Advanced Research in Computer and Communication Engineering., vol. 8, no. 5, p. 141-146, 2019. [CrossRef] [8] J. Chen and J. Stine, "Enhancing parallel-prefix structures using carry-save notation," 2008 51st Midwest Symposium on Circuits and Systems, 2008. [CrossRef] [Web of Science Times Cited 2] [SCOPUS Times Cited 4] [9] S. Banerjee and W. Rao, "A general design framework for sparse parallel prefix adders," Proceedings of IEEE Computer Society Annual Symposium on VLSI, ISVLSI, 2017-July, pp. 231-236, 2017. [CrossRef] [SCOPUS Times Cited 6] [10] D. Athur, B. Narayanan, A. Gopalakrishnan, S. Palanisamy, A. Angeline, "Design of novel high speed parallel prefix adder," Indonesian Journal of Electrical Engineering and Computer Science (IJEECS), vol. 29, no. 3, p. 1345, 2023. [CrossRef] [SCOPUS Times Cited 1] [11] K. Papachatzopoulos and V. Paliouras, "Static delay variation models for ripple-carry and borrow-save adders," in IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 66, no. 7, pp. 2546-2559, July 2019. [CrossRef] [Web of Science Times Cited 11] [SCOPUS Times Cited 10] [12] S. Patel, B. Garg, S. Rai, "A power and area efficient approximate carry skip adder for error resilient applications," Turkish Journal of Electrical Engineering and Computer Sciences , vol. 28, no. 1, p. 443-457, 2020. [CrossRef] [Web of Science Times Cited 2] [SCOPUS Times Cited 3] [13] C. Efstathiou, Z. Owda, Y. Tsiatouhas, "New high-speed multioutput carry look-ahead adders," IEEE Transactions on Circuits and Systems II, vol. 60, no. 10, p. 667-671, 2013. [CrossRef] [Web of Science Times Cited 19] [SCOPUS Times Cited 34] [14] D. Esposito, D. Caro, A. Strollo, "Variable latency speculative parallel prefix adders for unsigned and signed operands," IEEE Transactions on Circuits and Systems I, vol. 63, no. 8, p. 1200-1209, 2016. [CrossRef] [Web of Science Times Cited 41] [SCOPUS Times Cited 56] [15] R. Gowrishankar, N. Kumar, "Analysis of efficient 32 bit adder using tree grafting technique," Intelligent Automation & Soft Computing, vol. 35, no. 1, p. 1197-1209, 2023. [CrossRef] [Web of Science Times Cited 1] [SCOPUS Times Cited 2] [16] V. Pudi, K. Sridharan, F. Lombardi, "Majority logic formulations for parallel adder designs at reduced delay and circuit complexity," IEEE Transactions on Computers, vol. 66, no. 10, p. 1824-1830,2017. [CrossRef] [Web of Science Times Cited 20] [SCOPUS Times Cited 27] [17] D. Esposito, D. Caro, E. Napoli, N. Petra, A. Strollo, "Variable latency speculative Han-Carlson adder," IEEE Transactions on Circuits and Systems I, vol. 62, no. 5, p. 1353-1361, 2015. [CrossRef] [Web of Science Times Cited 32] [SCOPUS Times Cited 43] [18] M. Bahadori, M. Kamal, A. Afzali-Kusha, M. Pedram, "High-speed and energy-efficient carry skip adder operating under a wide range of supply voltage levels," IEEE Transactions on Very Large Scale Integration (VLSI) Systems , vol. 24, no. 2, p. 421-433, 2016. [CrossRef] [Web of Science Times Cited 28] [SCOPUS Times Cited 51] [19] S. Asif, M. Vesterbacka, "Performance analysis of radix-4 adders," Integration, vol. 45, no. 2, p. 111-120, 2012. [CrossRef] [Web of Science Times Cited 6] [SCOPUS Times Cited 6] [20] K. Mangesh, A. P. Chavan, and P. Narashimaraja, "Improved fault tolerant sparse kogge stone adder," International Journal of Computer Applications, vol. 75, no. 10, pp. 36-41, 2013 [21] G. Rani and S. Kumar, "Implementation of 128-bit sparse Kogge Stone adder using verilog," International Journal of Technical Research and Applications, vol. 2, no. 4, pp. 2320-8163, 2014 [22] D. K. Athur, B. Narayanan, A. Gopalakrishnan, A. A. Augustine, "Design of novel high speed parallel prefix adder," Indonesian Journal of Electrical Engineering and Computer Science, vol. 29, no. 3, pp. 1345-1354, March 2023. [CrossRef] [SCOPUS Times Cited 1] [23] M. Lokesh Chowdary, A. Mallaiah, A. Jaya Lakshmi, "Design of wallace tree multiplier using sparse Kogge-Stone and Brent-Kung adders," in: H. Saini, R. Singh, V. Patel, K. Santhi, S. Ranganayakulu (eds.), Innovations in Electronics and Communication Engineering, Lecture Notes in Networks and Systems, vol. 33, Springer, Singapore, 2019, pp. 271-279. [CrossRef] [Web of Science Record] [SCOPUS Times Cited 3] [24] C. C. Kai, S. Isaak, Y. Yusof, "16-bit fault tolerant sparse Kogge Stone adder using 0.18μm CMOS technology," in: 2020 IEEE International Conference on Semiconductor Electronics (ICSE), Kuala Lumpur, Malaysia, 2020, pp. 77-80. [CrossRef] [SCOPUS Times Cited 3] [25] X. Cui, W. Liu, S. Wang, et al., "Design of high-speed wide-word hybrid parallel-prefix/carry-select and skip adders," Journal of Signal Processing Systems, vol. 90, pp. 409-419, 2018. [CrossRef] [Web of Science Times Cited 16] [SCOPUS Times Cited 18] [26] Y. Bansal, C. Madhu, "A novel high-speed approach for 16 à 16 Vedic multiplication with compressor adders," Computers & Electrical Engineering, vol. 49, pp. 39-49, 2016. ISSN 0045-7906. [CrossRef] [Web of Science Times Cited 19] [SCOPUS Times Cited 38] [27] S. R. Sahu, B. K. Bhoi, M. Pradhan, "Fast signed multiplier using Vedic Nikhilam algorithm," IET Circuits, Devices & Systems, vol. 14, pp. 1160-1166, 2020. [CrossRef] [Web of Science Times Cited 5] [SCOPUS Times Cited 10] [28] A. Sai Kumar, U. Siddhesh, N. Sai Kiran, K. Bhavitha, "Design of high speed 8-bit vedic multiplier using Brent Kung adders," 2022 13th International Conference on Computing, Communication, and Networking Technologies (ICCCNT), Kharagpur, India, 2022, pp.1-5. [CrossRef] [SCOPUS Times Cited 28] [29] P. Saha, A. Banerjee, A. Dandapat, P. Bhattacharyya, "ASIC design of a high speed low power circuit for factorial calculation using ancient Vedic mathematics," Microelectronics Journal, Volume 42, Issue 12, 2011, Pages 1343-1352, ISSN 0026-2692. [CrossRef] [Web of Science Times Cited 27] [SCOPUS Times Cited 45] [30] A. Verma, A. Khan, & S. Wairya, "Design and analysis of efficient vedic multiplier for fast computing applications," International Journal of Computing and Digital Systems, vol. 13, no. 1, p. 643-655, 2023. [CrossRef] [SCOPUS Times Cited 6] [31] R. Mirzaee, M. Moaiyeri, H. Khorsand, K. Navi, "A new robust and high-performance hybrid full adder cell," Journal of Circuits, Systems, and Computers, vol. 20, no. 04, p. 641-655, 2011. [CrossRef] [Web of Science Times Cited 23] [SCOPUS Times Cited 31] [32] M. Shoba, R. Nakkeeran, "GDI based full adders for energy efficient arithmetic applications," Engineering Science and Technology, an International Journal, vol. 19, no. 1, p. 485-496, 2016. [CrossRef] [Web of Science Times Cited 52] [SCOPUS Times Cited 96] [33] M. Hasan, U. Saha, A. Sorwar, M. Dipto, M. Hossain, H. Zaman, "A novel hybrid full adder based on gate diffusion input technique, Transmission Gate and Static Cmos Logic," 2019 10th International Conference on Computing, Communication and Networking Technologies (ICCCNT), 2019. [CrossRef] [SCOPUS Times Cited 28] [34] K. Navi, O. Kavehei, M. Rouholamini, A. Sahafi, S. Mehrabi, N. Dadkhahi, "Low-power and high-performance 1-bit CMOS full-adder cell," Journal of Computational Physics, vol. 3, no. 2, 2008. [CrossRef] [Web of Science Times Cited 40] [SCOPUS Times Cited 85] [35] V. Foroutan, M. Taheri, K. Navi, A. Mazreah, "Design of two low-power full adder cells using GDI structure and hybrid CMOS logic style," Integration, vol. 47, no. 1, p. 48-61, 2014. [CrossRef] [Web of Science Times Cited 42] [SCOPUS Times Cited 69] [36] M. Amini-Valashani, M. Ayat, S. Mirzakuchaki, "Design and analysis of a novel low-power and energy-efficient 18t hybrid full adder," Microelectronics Journal, vol. 74, p. 49-59, 2018. [CrossRef] [Web of Science Times Cited 33] [SCOPUS Times Cited 57] [37] M. Hasan, A. Siddique, A. Mondol, M. Hossain, H. Zaman, S. Islam, "Comprehensive study of 1-bit full adder cells: Review, performance comparison and scalability analysis," SN Appl. Sci., vol. 3, no. 6, 2021. [CrossRef] [Web of Science Times Cited 10] [SCOPUS Times Cited 23] Web of Science® Citations for all references: 513 TCR SCOPUS® Citations for all references: 944 TCR Web of Science® Average Citations per reference: 14 ACR SCOPUS® Average Citations per reference: 25 ACR TCR = Total Citations for References / ACR = Average Citations per Reference We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more Citations for references updated on 2024-04-26 04:04 in 188 seconds. Note1: Web of Science® is a registered trademark of Clarivate Analytics. Note2: SCOPUS® is a registered trademark of Elsevier B.V. Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site. |
Copyright ©2001-2024
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.
