loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2005 IEEE International Conference on Application-Specific Systems, Architecture Processors (ASAP'05)
On-line Multioperand Addition Based on On-line Full Adders
Samos, Greece
July 23-July 25
ISBN: 0-7695-2407-9
Julio Villalba, Dept. of Computer Architecture University of Malaga. SPAIN
Javier Hormigo, Dept. of Computer Architecture University of Malaga. SPAIN
Jose M. Prades, Dept. of Computer Architecture University of Malaga. SPAIN
Emilio L. Zapata, Dept. of Computer Architecture University of Malaga. SPAIN

In this paper we deal with the on-line addition of multioperands for conventional, carry0-save (CS) and/or Signed- Digit (SD) numbers. We propose an on-line Full-Adder (olFA) as the key element to design trees of adders to deal with multioperands. We also consider mixed inputs (e.g. SD and CS) and how to obtain the output in any of these representations. We show that for dealing with on-line multioperands it is more efficient to work with on-line CS trees based on olFAs than with on-line SD tree based on on-line SD adders. Finally a novel olFA-based architecture is proposed to directly deal with SD numbers.

Citation:
Julio Villalba, Javier Hormigo, Jose M. Prades, Emilio L. Zapata, "On-line Multioperand Addition Based on On-line Full Adders," asap, pp.322-327, 2005 IEEE International Conference on Application-Specific Systems, Architecture Processors (ASAP'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.