Issue No. 12 - December (1974 vol. 23)
D. Kroft , Canadian Development Division, Control Data Canada Ltd.
This correspondence presents a simpler proof for Baugh and Wooley's two's complement parallel array multiplication algorithm, as demonstrated in a recent paper.1 The above algorithm converts a two's complement multiplication to an equivalent parallel array addition problem in which all partial product bits are positive.
Array multiplication, binary multiplication, parallel multiplication, two's complement multiplication.
D. Kroft, "Comments on "A Two's Complement Parallel Array Multiplication Algorithm"," in IEEE Transactions on Computers, vol. 23, no. , pp. 1327-1328, 1974.