Open Access Open Access  Restricted Access Subscription or Fee Access

An Efficient Implementation of 128 Bit Carry Save Adder

R. Arunsekar, K. Sanjeev, M. Saranya, G. Sandhya


This paper present a technology independent design and simulation of a modified architecture of the carry save order it require a minimum of logic gates binary addition is carried out by series of XOR,AND and shift left operations. These operations are terminated with a computer signal indicating that the result of addition is obtained. because the number of shift operation carried out and varies from 0 to n for n bit addends the method was developed in all the possible addends of 2 to 15 bits the mathematical model was detected and used to predict the number of shifts required for binary numbers such as 32.68 or 128 bits it is used in both synchronous and asynchronous modes of operation.

Full Text:



Bruce Gilchrist, J. H. Pomerene, and S. Y. Wong, “Fast Carry Logic for Digital Computers,” IRE Transactions on Electronic Computers, vol. EC-4, pp. 133-136, 1955.

E.E. SwartZlander, “Computer Arithmetic”, volume I, IEEE computer society press, 1990.

I. Koren, “Computer arithmetic algorithms”, Prentice-Hall, 1993

F.C Cheng, S. H. Unger, “Self-Timed Carry-Look Ahead Adders”, IEEE Transactions on Computers, Vol. 49, No. 7, July 2000.

M. Alioto, G. Palumbo, “Analysis and Comparison on Full Adder Block in Submicron Technology”, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Vol. 10, No. 6, December 2002.

M. D. Ercegovac, T. Lang, “Digital Arithmetic”, Morgan Kaufmann Publishers. An imprint of Elsevier Science, 2004.

B. Parhami, “Computer Arithmetic, Algorithm and Hardware Design”, Oxford University Press, New York, pp. 91-119, 2000.

R. P. P. Singh, P. Kumar, B. Singh, “Performance Analysis of 32-bit Array Multiplier with a Carry Save Adder and with a Carry Look Ahead Adder”, International Journal of Recent Trends in Engineering, Vol. 2, No. 6, November 2009.

T. Kim, W. Jao, and S. Tjiang, “Arithmetic optimization using carry-save-adders”, in Proc. Design Automation Conf., Jun. 1998, pp. 433–438. ChakibAlaoui International Journal of Engineering (IJE), Volume (5) : Issue (1) : 2011 113.

T. Kim and J. Um, “A timing-driven synthesis of arithmetic circuits using carry-save-adders”, in Proc. Asia and South Pacific Design Automation Conf., Jan. 2000, pp. 313–316.

Y. Kim and T. Kim, “An accurate exploration of timing and area trade-offs in arithmetic optimization using carry-save adder cells”, in Proc. Midwest Symposium on Circuit and Systems, Aug. 2000.

T. Kim, W. Jao,an d S. Tjiang,“Circuit Optimization using Carry-Save-Adder Cells”, IEEE TCAD, October 1998.

J. Um, T. Kim, C. L. Liu, “Optimal Allocation of Carry-Save-Adders in Arithmetic Optimization”, Proc. ICCAD, 1999.

B.Ramkumar, H. M Kittur, P.MaheshKannan, “ASIC implementation of Modified Faster Carry Save Adder”. European Journal of Scientific Research. ISSN 1450-216X, Vol.42 No.1, 2010, pp.53-58.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.