Conceptually, the simplest method for multiplying signed integers consists in computing, from the representations of the operands X and Y, the corresponding absolute value of the product together with the appropriate sign. The absolute value of the product would be obtained by one of the methods described before, while the product sign would be readily given through the exclusive OR function applied to a suitable binary representation of the respective signs. The process would then be completed by the computation of the signed representation of the result. This method is appropriate whenever the operands are provided in sign-magnitude form. In this case, signed multiplication appears trivial. In the case of B's complement or signed-digit representations, other methods have to be recommended.

5.2.1 B's Complement Multiplication

Let X and Y be two integers represented in the reduced B's complement numeration system (Chapter 3, Comment 3.2):


xn−1 and ym−1 are called sign-digits (sign-bits for B = 2). The respective weights of X and Y can be positive or negative according to the following definitions.

X and Y can be expressed in the form


where image = 0 if xn−1 = 0 and = −1 if ...

Get Synthesis of Arithmetic Circuits: FPGA, ASIC and Embedded Systems now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.