High-speed iterative array for binary multiplication

High-speed iterative array for binary multiplication

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.

An iterative array for the multiplication of binary numbers and also the addition of either one or two other numbers is proposed, employing r.o.m.s. as lookup tables. The regularity of this array should make it attractive for l.s.i. fabrication.


    1. 1)
      • J.C. Hoffman , B. Lacaze , P. Csillag . Multiplieur parallèle à circuits logiques itératifs. Electron. Lett.
    2. 2)
      • K.J. Dean . Design for a full multiplier. Proc. IEE , 1592 - 1594
    3. 3)
      • H.H. Guild . Fully iterative fast array for binary multiplication and fast addition. Electron. Lett.
    4. 4)
      • T.J. Chung , S.D. Bedrosian . Iterative digital multiplier based on cellular arrays of r.o.m.s. Electron. Lett. , 426 - 428
    5. 5)
      • T.J. Chung , S.D. Bedrosian . Alternative iterative digital multiplier based on cellular arrays of r.o.m.s.. Electron. Lett. , 447 - 448

Related content

This is a required field
Please enter a valid email address