Coursify

Booth’s Algorithm: Purpose and How It Works (Signed Binary Multiplication)

Booth’s Algorithm: Purpose and How It Works (Signed Binary Multiplication)

Verified Sources
Nov 4, 2026

Booth’s algorithm is used for Algorithm multiplication of signed binary numbers. It reduces the number of addition/subtraction operations by using bit-pair recoding (inspecting runs of 1s in the multiplier). This makes it well-suited for implementing signed nn-bit multiplication in hardware/software arithmetic units, typically via repeated shifts plus conditional add/subtract steps.2

To answer the multiple-choice prompt directly:

  • (i) Floating point operations → No
  • (ii) Character coding → No
  • (iii) Division → No
  • (iv) Multiplication → Yes

Key terms to remember: Signed multiplication Multiplier recoding Arithmetic shift Two’s complement

Footnotes

  1. Booth’s multiplication algorithm - Encyclopaedia Britannica - Describes Booth’s algorithm for binary multiplication using recoding to reduce operations. ↩

  2. Booth algorithm - Wikipedia - Explains signed binary multiplication using recoding with arithmetic right shifts. ↩

Booth’s Algorithm for Signed Multiplication (Explanation + Example)

Booth’s algorithm targets the multiplication operation specifically: it multiplies a multiplicand by a multiplier represented in two’s complement, producing a 2n2n-bit product while properly handling negative values.2 In contrast, division algorithms are different (they iteratively shift and subtract/restore quotient bits), and floating point operations involve mantissa/exponent manipulation rather than bit-pair recoding.

Why Booth’s Algorithm is “for multiplication”

At a high level, Booth’s method iterates over the multiplier bits and repeatedly updates an accumulator using rules derived from pairs like (Q0,Q−1)(Q_0, Q_{-1}), where Q−1Q_{-1} is typically initialized to 0.2

Footnotes

  1. Booth’s multiplication algorithm - Encyclopaedia Britannica - Describes Booth’s algorithm for binary multiplication using recoding to reduce operations. ↩ ↩2

  2. Booth algorithm - Wikipedia - Explains signed binary multiplication using recoding with arithmetic right shifts. ↩ ↩2

  3. Restoring division - Wikipedia - Overview of division approaches, showing division uses different iterative subtraction/quotient construction than Booth multiplication. ↩

Core Procedure of Booth’s Algorithm (Signed Multiplication)

  1. 1
    Step 1

    Set multiplicand MM, accumulator A=0A=0, multiplier QQ, and set Q−1=0Q_{-1}=0 for bit-pair examination.

  2. 2
    Step 2

    For i=1i=1 to nn, check the pair (Q0,Q−1)(Q_0, Q_{-1}).

  3. 3
    Step 3

    If (Q0,Q−1)=01(Q_0,Q_{-1})=01, do A=A+MA=A+M; if 1010, do A=A−MA=A-M; if 0000 or 1111, do nothing.

  4. 4
    Step 4

    Perform an arithmetic right shift of the combined (A,Q,Q−1)(A,Q,Q_{-1}) registers.

  5. 5
    Step 5

    After nn iterations, the product is the concatenation (A,Q)(A,Q).

Mapping the multiple-choice options

OptionStatementCorrect?Reason (Booth context)
(i)Floating point operations❌Booth targets integer signed multiplication (two’s complement), not floating exponent/mantissa handling.
(ii)Character coding❌Character coding uses encoding schemes (e.g., ASCII/Unicode), not Booth’s arithmetic recoding.
(iii)Division❌Division uses quotient-reconstruction/iteration methods, not Booth’s signed multiplier recoding.
(iv)Multiplication✅Booth is explicitly designed for signed binary multiplication via recoding + shifts.

Exam shortcut

If the options include “multiplication” vs “division/floating point/character coding,” Booth’s algorithm almost always corresponds to signed binary multiplication.

Common confusion

Don’t confuse Booth’s algorithm with algorithms for division (e.g., restoring/non-restoring division) or with floating-point normalization/alignment. Booth’s key feature is multiplier bit-pair recoding for faster signed multiplication.2

Footnotes

  1. Booth’s multiplication algorithm - Encyclopaedia Britannica - Describes Booth’s algorithm for binary multiplication using recoding to reduce operations. ↩

  2. Booth algorithm - Wikipedia - Explains signed binary multiplication using recoding with arithmetic right shifts. ↩

Where Booth’s Algorithm Fits in Digital Arithmetic

Two’s complement setup

Signed integer representation

Prepare MM and QQ in two’s complement so negatives are handled correctly."

Booth recoding + add/sub

Multiplication core

Use (Q0,Q−1)(Q_0, Q_{-1}) to decide whether to add, subtract, or do nothing."

Arithmetic shifts over iterations

Result formation

Repeated arithmetic right shifts move partial products into place."

Product available

Completion

After nn cycles, (A,Q)(A,Q) represents the final 2n2n-bit product."

FAQ: Booth’s algorithm and related topics

Knowledge Check

Question 1 of 3
Q1Single choice

Booth's algorithm is used for:

Explore Related Topics

1

Binary Parallel Adder: Short Note with Core Concepts and Implementation

2

IEEE 754 Floating-Point Representation: Explanation and Worked Examples

3

Decimal Adjust After Addition (DAA) in x86: How It Converts Binary Sums to Valid BCD

Browse all research articles