This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Multioperand Parallel Decimal Adder: A Mixed Binary and BCD Approach
October 2007 (vol. 56 no. 10)
pp. 1320-1328
Decimal arithmetic has been in recent years revived due to the large amount of data in commercial applications. We consider the problem of Multi Operand Parallel Decimal Addition with an approach that uses binary arithmetic, suggested by the adoption of BCD numbers. This involves corrections in order to obtain the BCD result, or a binary to decimal conversion. We adopt the latter approach, particularly efficient for a large number of addends. Conversion requires a relatively small area and can afford fast operation. The BD conversion, moreover, allows an easy alignment of the sums of adjacent columns. We treat the design of BCD digit adders using fast carry free adders and the conversion problem through a known parallel scheme using elementary conversion cells. Spreadsheets have been developed for adding several BCD digits and for simulating the binary to decimal conversion as design tool.

[1] A.V. Burks, H.H. Goldstine, and J. von Neumann, “Preliminary Discussion and Logical Design of an Electronic Computing Instrument,” Inst. for Advanced Study, Princeton, N.J., June 1946.
[2] R.K. Richards, Arithmetic Operations in Digital Computers. Van Nostrand, 1955.
[3] L. Dadda, “Some Schemes for Parallel Multipliers,” Alta Frequenza, vol. 19, pp. 349-356, Mar. 1965.
[4] M.S. Schmookler and A. Weinberger, “High Speed Decimal Addition,” IEEE Trans. Computers, vol. 20, no. 8, pp. 862-866, Aug. 1971.
[5] J.D. Nicoud, “Iterative Arrays for Radix Conversion,” IEEE Trans. Computers, vol. 20, no. 12, pp. 1479-1489, Dec. 1971.
[6] J.M. Muller, Arithmetique des Ordinateurs. Masson, 1989.
[7] I. Koren, Computer Arithmetic Algorithms. Prentice Hall, 1993.
[8] H.H. Goldstine and A. Goldstine, “The Electronic Numerical Integrator and Computer,” IEEE Annals of the History of Computing, vol. 18, no. 1, pp. 10-16, 1996.
[9] M.F. Cowlishaw, “Decimal Floating-Point: Algorithm for Computers,” Proc. 16th IEEE Symp. Computer Arithmetic, pp. 104-111, June 2003.
[10] M.A. Erle and M.J. Schulte, “Decimal Multiplication via Carry-Save Addition,” Proc. IEEE Int'l Conf. Application-Specific Systems, Architectures, and Processors, pp. 348-358, June 2003.
[11] R.D. Kenney and M.J. Schulte, “High Speed Multioperand Decimal Adders,” IEEE Trans. Computers, vol. 54, no. 8, pp. 953-963, Aug. 2005.
[12] L. Dadda, “A Compact Dot-Notation for the Design of Binary Parallel Adders, Multipliers and Adders of Products,” ALaRI Internal Report, http://www.alari.ch/people/dadda/home/DotNotation DotNotation.htm, 2005.
[13] L. Dadda, “Parallel Decimal Multipliers: A Hybrid Approach,” ALaRI Internal Report, 2005.
[14] Y. You, Y.D. Kim, and J.H. Choi, “Dynamic Decimal Adder Circuit Design by Using the Carry Lookahead,” Proc. Design and Diagnostic of Electronic Circuits and Systems, pp. 242-244, Apr. 2006.
[15] L. Dadda, “Multi Operand Parallel Decimal Adders: Spreadsheet Tools,” ALaRI Internal Report, http://www.alari.ch/people/dadda/home/MultiopAdder MoAd.htm, 2006.

Index Terms:
Computer arithmetic, decimal arithmetic, multioperand adders, hardware design
Citation:
Luigi Dadda, "Multioperand Parallel Decimal Adder: A Mixed Binary and BCD Approach," IEEE Transactions on Computers, vol. 56, no. 10, pp. 1320-1328, Oct. 2007, doi:10.1109/TC.2007.1067
Usage of this product signifies your acceptance of the Terms of Use.