Comment on the speed of binary multiplication using cellular arrays

Comment on the speed of binary multiplication using cellular arrays

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

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.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:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A known recoding algorithm is considered and is shown to yield a speed improvement of approximately 33% for serial multiplication. However, in the case of cellular-array multipliers, such a recoding appears to offer no advantage; instead, it may even result in a speed penalty owing to the sequential nature of the recoding algorithm.


    1. 1)
      • I. Flores . (1963) , The logic of computer arithmetic.
    2. 2)
      • O.L. Macsorley . High speed arithmetic in binary computers. Proc. Inst. Radio Engrs. , 67 - 91
    3. 3)
      • S.D. Pezaris . A 40-ns 17-bit by 17-bit array multiplier. IEEE Trans. , 442 - 447
    4. 4)
      • H. Ling . High-speed computer multiplication using a multiple-bit decoding algorithm. IEEE Trans. , 706 - 709
    5. 5)
      • H.H. Guild . Fully iterative fast array for binary multiplication and addition. Electron. Lett.
    6. 6)
      • J.C. Majithia , R. Kitai . An iterative array for multiplication of signed binary numbers. IEEE Trans. , 214 - 216
    7. 7)
      • P.M. Fenwick . Binary multiplication with overlapped addition cycles. IEEE Trans. , 71 - 74

Related content

This is a required field
Please enter a valid email address