Abstract :
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.
Keywords :
Array multiplication, binary multiplication, parallel multiplication, two´s complement multiplication.; Algorithm design and analysis; Concurrent computing; Military computing; Optimal control; Parallel processing; Programmable logic arrays; Tree data structures; Wire; Array multiplication, binary multiplication, parallel multiplication, two´s complement multiplication.;
