Institute of Information Engineering
Taichung, Taiwan 407, R.O.C.
Indirect two's complement multipliers are well known in computer basic arithmetic units. Besides multiplication, four additional procedures are required, i.e., pre-and post-one's complement cycles, and adding "1" to the pre- and post- one's complement cycles. To overcome this drawback, Pezaris first proposed a direct multiplication scheme using four types of full adders to simplify these four procedures and, thus, speed-up the multiplication. Unfortunately, it is not suitable for VLSI implementation. Then, Baugh-Wooley proposed using only one type of full adder to simplify the array structure. However, it needs three additional full adders, resulting in a nonsquare array. This paper proposes a new structure for direct two's complement multiplication. Its array consists of only one type of full adder, and its shape is rectangular. In addition, a simple algorithm for this direct multiplications is designed.
Keywords: computer arithmetic, multiplier module, parallel multiplier, recursive multiplication, two's complement multiplication
Received August 17, 1995; revised June 27, 1996.
Communicated by Youn-Long Lin.
* This research work was supported by National Science Council under grant No. NSC 83-0408-E-035-004.