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.
No takes yet. Share an insight, caveat, or question.
Baugh et al. (1973) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: