http://iet.metastore.ingenta.com
1887

Cellular multiplier for signed binary numbers

Cellular multiplier for signed binary numbers

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

Buy article PDF
$19.95
(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
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
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 algorithm for the multiplication of twos-complement numbers in cellular arrays is described. Its use in a multiplication array is shown.

References

    1. 1)
      • I. Flores . (1963) , The logic of computer arithmetic.
    2. 2)
      • J.C. Hoffmann , B. Lacaze , P. Csillag . Multiplieur paralèlle à circuits logiques itèratifs. Electron Lett.
    3. 3)
      • H.H. Guild . Fully iterative fast array for binary multiplication and addition. Electron Lett.
    4. 4)
      • J.C. Majithia , R. Kitai . An iterative array for multiplication of signed binary numbers. IEEE Trans. , 214 - 216
    5. 5)
      • Gex, A.: `Unite arithmetique et logique ultrarapide', 1971, Diploma thesis, École Polytechnique Fédérale de Lausanne.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19710293
Loading

Related content

content/journals/10.1049/el_19710293
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address