Loading [MathJax]/extensions/MathMenu.js
A Two's Complement Parallel Array Multiplication Algorithm | IEEE Journals & Magazine | IEEE Xplore

A Two's Complement Parallel Array Multiplication Algorithm


Abstract:

An algorithm for high-speed, two's complement, m-bit by n-bit parallel array multiplication is described. The two's complement multiplication is converted to an equivalen...Show More

Abstract:

An algorithm for high-speed, two's complement, m-bit by n-bit parallel array multiplication is described. The two's complement multiplication is converted to an equivalent parallel array addition problem in which each partial product bit is the AND of a multiplier bit and a multiplicand bit, and the signs of all the partial product bits are positive.
Published in: IEEE Transactions on Computers ( Volume: C-22, Issue: 12, December 1973)
Page(s): 1045 - 1047
Date of Publication: 14 August 2006

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.