BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CSL-TR-92-528
       ENTRY:: November 02, 1994
ORGANIZATION:: Stanford University, Computer Systems Laboratory
       TITLE:: Binary multiplication Using Partially Redundant Multiples
        TYPE:: Technical Report
      AUTHOR:: Bewick, Gary
      AUTHOR:: Flynn, Michael J.
        DATE:: June 1992
       PAGES:: 28
    ABSTRACT:: This report presents an extension to Booth's algorithm for
               binary multiplication. Most implementations that utilize
               Booth's algorithm use the 2 bit version, which reduces the
               number of partial products required to half that required by
               a simple add and shift method. Further reduction in the
               number of partial products can be obtained by using higher
               order versions of Booth's algorithm, but it is necessary to
               generate multiples of one of the operands (such as 3 times an
               operand) by the use of a carry propagate adder. This carry
               propagate addition introduces significant delay and
               additional hardware. The algorithm described in this report
               produces such difficult multiples in a partially redundant
               form, using a series of small length adders. These adders
               operate in parallel with no carries propagating between them.
               As a result, the delay introduced by multiple generation is
               minimized and the hardware needed for the multiple generation
               is also reduced, due to the elimination of expensive carry
               lookahead logic.
       NOTES:: [Adminitrivia V1/Prg/19941102]
         END:: STAN//CSL-TR-92-528