Which one of the following techniques is used to speed up the multiplication of two signed binary numbers in 2's complement notation?

Booth Algorithm:

• The booth algorithm is a multiplication algorithm that allows us to multiply the two signed binary integers in 2's complement, respectively.
• It is also used to speed up the performance of the multiplication process.
• Booth algorithm facilitates the process of multiplying signed numbers.
• Booth's analysis conclude that an ALU that could add or subtract could get the same result in more than one way.

Example:

4 + 3 = 7

8 - 1 = 7

At this time, shifting was faster than addition. Hence reducing the number of additions increased performance.

Additional Information 1. K-Map is a systematic way of simplifying Boolean expressions. With the help of K-map method, we can find the simplest SOP and POS expression, which is known as minimum expression.

2. In mathematics, Pascal's triangle is a triangular array of binomial coefficients.

3. De-Morgan's theorem is the component of product of all the terms is equal to the sum of the component of each term. Likewise, the complement of sum of all the terms is equal to the product of the complement of each term.