Binary-coded decimal digit multipliers

Binary-coded decimal digit multipliers

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Computers & Digital Techniques — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

With the growing popularity of decimal computer arithmetic in scientific, commercial, financial and Internet-based applications, hardware realisation of decimal arithmetic algorithms is gaining more importance. Hardware decimal arithmetic units now serve as an integral part of some recently commercialised general purpose processors, where complex decimal arithmetic operations, such as multiplication, have been realised by rather slow iterative hardware algorithms. However, with the rapid advances in very large scale integration (VLSI) technology, semi- and fully parallel hardware decimal multiplication units are expected to evolve soon. The dominant representation for decimal digits is the binary-coded decimal (BCD) encoding. The BCD-digit multiplier can serve as the key building block of a decimal multiplier, irrespective of the degree of parallelism. A BCD-digit multiplier produces a two-BCD digit product from two input BCD digits. We provide a novel design for the latter, showing some advantages in BCD multiplier implementations.


    1. 1)
      • Cowlishaw, M.F.: `Decimal floating-point: algorism for computers', Proc. 16th IEEE Symposium on Computer Arithmetic, June 2003, p. 104–111.
    2. 2)
      • Busaba, F.Y., Krygowski, C.A., Li, W.H., Schwarz, E.M., Carlough, S.R.: `The IBM Z900 decimal arithmetic unit', Asilomar Conf. on Signals, Systems and Computers, November 2001, 2, p. 1335–1339.
    3. 3)
      • Erle, M.A., Schulte, M.J.: `Decimal multiplication via carry-save addition', Conf. on Application-Specific Systems, Architectures, and Processors, June 2003, p. 348–358.
    4. 4)
      • Erle, M.A., Schwartz, E.M., Schulte, M.J.: `Decimal multiplication with efficient partial product generation', 17thIEEE Symp. on Computer Arithmetic, (ARITH-17), June 2005, p. 21–28.
    5. 5)
      • Ohtsuki, T., Oshima, Y., Ishikawa, S., Yabe, K., Fukuta, M.: `Apparatus for decimal multiplication', U.S. Patent 4677583, June 1987.
    6. 6)
      • Ueda, T.: `Decimal multiplying assembly and multiply module', U.S. Patent 5379245, January 1995.
    7. 7)
      • R.H. Larson . High-speed multiply using four input carry save adder. IBM Technical Disclosure Bull. , 7 , 2053 - 2054
    8. 8)
    9. 9)
      • C.S. Wallace . A suggestion for fast multiplier. IEEE Trans. Electron. Comput. , 14 - 17
    10. 10)
      • L. Dadda . Some schemes for parallel multipliers. Alta Frequenza , 349 - 356
    11. 11)
      • G. Goto , T. Sato , M. Nakajima , T. Sukemura . A 54 × 54-b regularly structured treemultiplier. IEEE J. Solid-State Circuits , 9 , 1229 - 1236
    12. 12)
      • M. Schmookler . High-speed binary-to-decimal conversion. IEEE Trans. Comput. , 5 , 506 - 508
    13. 13)
      • V.T. Rhyne . Serial binary-to-decimal and decimal-to-binary conversion. IEEE Trans. Comput. , 9 , 808 - 812
    14. 14)
    15. 15)
      • M. Schmookler , A. Weinberger . High-speed decimal addition. IEEE Trans. Comput. , 8 , 862 - 866
    16. 16)
      • Kenney, R.D., Schulte, M.J., Erle, M.A.: `A high-frequency decimal multiplier', IEEE Int. Conf. Computer Design: VLSI in Computers and Processors (ICCD), Oct 2004, p. 26–29.

Related content

This is a required field
Please enter a valid email address