|
Vol: 47(61) No: 2 / June 2002 Analyses On The Effectivness Of Using The Carry Save Adder In Multipliers Units Daniela E. Popescu Department of Computers, University of Oradea, Armatei Romane 5, Oradea, Romania, phone: 0040-59-211162, e-mail: depopescu@uoradea.ro Corneliu Popescu Department of Automation, University of Oradea, Armatei Romane 5, Oradea, Romania, phone: 0040-59-211162, e-mail: corneliu_popescu@uoradea.ro Keywords: lookahead techniques, carry propagation, carry save adder Abstract There are two basic ways in which the basic procedures can be speeded up: speeding up each addition and reducing the number of additions required. Faster addition can be achieved through the use of progressively faster adders (carry-ripple adder, carrycomplete full adder, carry-skip adder, carry-lookahead adder, carry-select adder). The problem is that once the list of this adders has been exhausted, some other method for speeding up the addition process is needed; one such method is that of using carry save adders, which is analyzed in this paper. References [1] Mou, Z-J. and F.Futand. “Overturned-stairs” adder trees and multiplier design, IEEE Trans. on Computers, vol.41, no.8, pp. 940- 948, 1992 [2] Vassiliadis, S., E.M.Schwartz, D.J.Hanranhan. “A general proof for overlapped multiple-bit scanning multiplications”, IEEE Trans. on Computers, vol.38, no.2, pp. 172-183, 1989 [3] Vassiliadis, S., E.M.Schwartz, B.M.Sung. “Hardwired-multipliers with encoded partial products”, IEEE Trans. on Computers, vol.38, no.2, pp. 172-183, 1991 [4] Amos R. Omondi. “Computer Arithmetic Systems. Algotithms, Architecture and Implementation”, Prentice Hall, 1994 [5] D.E.Popescu, “Introducere în arhitectura sistemelor convenþionale de calcul”, Editura Matrix Rom., Bucuresti 2000, ISBN 973-685-067-6 [6] D.E.Popescu, “Contribuþii la testarea si cresterea fiabilitatii unui sistem de calcul si sinteza testabila a echipamentelor de calcul cu fiabilitate sporita, teza de doctorat, Timisoara 1998 [7] D.E.Popescu, C.Popescu, “A Comparative Estimations Of Adders Trough The Angle Of The Performability Indicator”, RSEEE2000 – Oradea, Computer Science And Reability, pp.83-87, 2000 |