AUTOMATED SYNTHESIS OF A HIGH-SPEED ADDER

Padmanabhan Balasubramanian, Nikos E Mastorakis

DOI Number
https://doi.org/10.2298/FUEE2503457B
First page
457
Last page
468

Abstract


At the gate level, the Kogge-Stone adder (KSA) is known to outperform many high-speed adders including other parallel prefix adders in terms of the speed performance. This paper presents a methodology to synthesize a new high-speed adder automatically, called the AHSA, using a logic synthesis tool. We describe what adder architectures can be input to a logic synthesis tool and what synthesis constraints should be specified so that the AHSA can be automatically synthesized. The AHSA is significant since it has a speed similar to that of the KSA while requiring less area and dissipating less power. In this paper, 32-bit addition serves as an example, and various adders belonging to different architectures were synthesized using a 28 nm Synopsys CMOS standard cell library. The design metrics estimated show that while the KSA has a 5.2% reduced delay than the AHSA, the AHSA occupies 29.1% less area and consumes 9.6% less power than the KSA. In terms of the figures of merit used for a digital circuit design such as power-delay product (PDP), area-delay product (ADP), and power-delay-area product (PDAP), the AHSA achieves a 4.7% reduced PDP, a 25.2% reduced ADP, and a 32.4% reduced PDAP compared to the KSA. This paper demonstrates that when speed is the key factor in an adder design, the AHSA is preferable to the KSA. Moreover, the AHSA is shown to be significantly faster than other high-speed adders at the gate level.

Keywords

digital circuits, computer arithmetic, adder, logic design, CMOS, high-speed

Full Text:

PDF

References


H. Zhang, M. Putic and J. Lach, "Low Power GPGPU Computation with Imprecise Hardware", In Proceedings of the 51st Design Automation Conference, 2014, pp. 1-6.

L. Wanhammar, DSP Integrated Circuits, Cambridge, MA, USA: Academic Press, 1999.

D. C. Chen, L. M. Guerra, E. H. Ng, M. Potkonjak, D. P. Schultz and J. M. Rabaey, "An Integrated System for Rapid Prototyping of High Performance Algorithm Specific Data Paths", In Proceedings of the International Conference on Application Specific Array Processors, 1992, pp. 134-148.

J. D. Garside, "A CMOS VLSI Implementation of an Asynchronous ALU", In Proceedings of the IFIP WG10.5 Working Conference on Asynchronous Design Methodologies, 1993, 181-192.

A. R. Omondi, Computer Arithmetic Systems: Algorithms, Architecture and Implementations, New York, USA: Prentice Hall, 1994.

M. D. Ercegovac and T. Lang, Digital Arithmetic, Burlington, MA, USA: Morgan Kaufmann Publishers, 2004.

P. Balasubramanian, K. Prasad and N. E. Mastorakis, "A Standard Cell Based Synchronous Dual-Bit Adder with Embedded Carry Look-Ahead", WSEAS Trans. Circ. Syst., vol. 9, pp. 736-745, Dec. 2010.

J. Sklansky, "Conditional-Sum Addition Logic", IRE Trans. Electron. Comput., vol. EC-9, pp. 226-231, June 1960.

B. Parhami, Computer Arithmetic: Algorithms and Hardware Designs, 1st Edition, New York, USA: Oxford University Press, 2000.

O. J. Bedrij, "Carry-Select Adder", IRE Trans. Electron. Comput., vol. EC-11, pp. 340-346, June 1962.

T.-Y. Chang and M.-J. Hsiao, "Carry-Select Adder using Single Ripple-Carry Adder", Electron. Lett., vol. 34, pp. 2101-2103, Oct. 1998.

B. Ramkumar and H. M. Kittur, "Low-Power and Area-Efficient Carry Select Adder", IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 20, pp. 371-375, Feb. 2012.

G. B. Rosenberger, Simultaneous Carry Adder, U.S. Patent 2966305, 27 December 1960.

H. Ling, "High-Speed Binary Adder", IBM J. Res. Dev., vol. 25, pp. 156-166, May 1981.

P. Balasubramanian and D. L. Maskell, "A New Carry Look-Ahead Adder Architecture Optimized for Speed and Energy", Electronics, vol. 13, p. 3668, Sept. 2024.

S. Knowles, "A Family of Adders", In Proceedings of the 15th IEEE Symposium on Computer Arithmetic, 2001, pp. 1–8.

R. P. Brent and H. T. Kung, "A Regular Layout for Parallel Adders", IEEE Trans. Comput., vol. C-31, pp. 260-264, March 1982.

J. Sklansky, "An Evaluation of Several Two-Summand Binary Adders", IRE Trans. Electron. Comput., vol. EC-9, pp. 213-226, June 1960.

P. M. Kogge and H. S. Stone, "A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations", IEEE Trans. Comput., vol. 100, pp. 786-793, Aug. 1973.

P. Balasubramanian and N. E. Mastorakis, "High-Speed and Energy-Efficient Carry Look-Ahead Adder", J. Low Power Electron. Appl., vol. 12, p. 46, Aug. 2022.

[Online] Available at: https://github.com/balaccds/32-bit-carry-look-ahead-adder

Synopsys SAED_EDK32/28_CORE Databook, Revision 1.0.0. January 2012.

A. Yazdanbakhsh, D. Mahajan, H. Esmaeilzadeh and P. Lofti-Kamran, "AxBench: A Multiplatform Benchmark Suite for Approximate Computing", IEEE Design & Test, vol. 34, pp. 60-68, Apr. 2017.

P. Balasubramanian and N. Mastorakis, "Performance Comparison of Carry-Lookahead and Carry-Select Adders Based on Accurate and Approximate Additions", Electronics, vol. 7, p. 369, Dec. 2018.


Refbacks

  • There are currently no refbacks.


ISSN: 0353-3670 (Print)

ISSN: 2217-5997 (Online)

COBISS.SR-ID 12826626