BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CSL-TR-95-684
       ENTRY:: January 22, 1996
ORGANIZATION:: Stanford University, Computer Systems Laboratory
       TITLE:: Performance/Area Tradeoffs in Booth Multipliers
        TYPE:: Technical Report
      AUTHOR:: Al-Twaijry, Hesham
      AUTHOR:: Flynn, Michael J.
        DATE:: November 1995
       PAGES:: 24
    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.
       NOTES:: [Adminitrivia V1/Prg/19960122]
         END:: STAN//CSL-TR-95-684