A New Carry Look-Ahead Adder Architecture Optimized for Speed and Energy

被引:1
作者
Balasubramanian, Padmanabhan [1 ]
Maskell, Douglas L. [1 ]
机构
[1] Nanyang Technol Univ, Coll Comp & Data Sci, 50 Nanyang Ave, Singapore 639798, Singapore
关键词
arithmetic circuits; digital circuits; adder; high-speed; energy-efficient; ASIC; CMOS;
D O I
10.3390/electronics13183668
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We introduce a new carry look-ahead adder (NCLA) architecture that employs non-uniform-size carry look-ahead adder (CLA) modules, in contrast to the conventional CLA (CCLA) architecture, which utilizes uniform-size CLA modules. We adopted two strategies for the implementation of the NCLA. Our novel approach enables improved speed and energy efficiency for the NCLA architecture compared to the CCLA architecture without incurring significant area and power penalties. Various adders were implemented to demonstrate the advantages of NCLA, ranging from the slower ripple carry adder to the widely regarded fastest parallel-prefix adder viz. the Kogge-Stone adder, and their performance metrics were compared. The 32-bit addition was used as an example, with the adders implemented using a semi-custom design method and a 28 nm CMOS standard cell library. Synthesis results show that the NCLA architecture offers substantial improvements in design metrics compared to its high-speed counterparts. Specifically, an NCLA achieved (i) a 14.7% reduction in delay and a 13.4% reduction in energy compared to an optimized CCLA, while occupying slightly more area; (ii) a 42.1% reduction in delay and a 58.3% reduction in energy compared to a conditional sum adder, with an 8% increase in the area; (iii) a 14.7% reduction in delay and a 37.7% reduction in energy compared to an optimized carry select adder, while requiring 37% less area; and (iv) a 20.2% reduction in energy and a 55.4% reduction in area compared to the Kogge-Stone adder.
引用
收藏
页数:18
相关论文
共 36 条
[1]  
[Anonymous], 2012, Synopsys SAEDEDK32/28CORE Databook
[2]  
Balasubramanian Padmanabhan, 2010, WSEAS Transactions on Circuits and Systems, V9, P736
[3]  
Balasubramanian P., 2024, P IEEE PAC RIM C COM
[4]   High-Speed and Energy-Efficient Carry Look-Ahead Adder [J].
Balasubramanian, Padmanabhan ;
Mastorakis, Nikos E. .
JOURNAL OF LOW POWER ELECTRONICS AND APPLICATIONS, 2022, 12 (03)
[5]   Performance Comparison of Carry-Lookahead and Carry-Select Adders Based on Accurate and Approximate Additions [J].
Balasubramanian, Padmanabhan ;
Mastorakis, Nikos .
ELECTRONICS, 2018, 7 (12)
[6]  
Bedrij O. J., 1962, IRE Trans. Electron. Comput, VEC-11, P340, DOI DOI 10.1109/IRETELC.1962.5407919
[7]   A REGULAR LAYOUT FOR PARALLEL ADDERS [J].
BRENT, RP ;
KUNG, HT .
IEEE TRANSACTIONS ON COMPUTERS, 1982, 31 (03) :260-264
[8]   Carry-select adder using single ripple-carry adder [J].
Chang, TY ;
Hsiao, MJ .
ELECTRONICS LETTERS, 1998, 34 (22) :2101-2103
[9]  
Chen D.C., 1992, P INT C APPL SPEC AR
[10]   Design and Implementation of Digital Down Converter for WiFi Network [J].
Datta, Debarshi ;
Dutta, Himadri Sekhar .
IEEE EMBEDDED SYSTEMS LETTERS, 2024, 16 (02) :122-125