Report Number: CSL-TR-95-684
Institution: Stanford University, Computer Systems Laboratory
Title: Performance/Area Tradeoffs in Booth Multipliers
Author: Al-Twaijry, Hesham
Author: Flynn, Michael J.
Date: November 1995
Abstract: Booth encoding is a method of reducing the number of summands
required to produce the multiplication result. This paper
compares the performance/area tradeoffs for the different
Booth algorithms when trees are used as the summation
network. This paper shows that the simple non-Booth algorithm
is not a viable design, and that currently Booth 2 is the
best design. It also points out that in the future Booth 3
may offer the best performance/area ratio.