BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CSL-TR-94-654
       ENTRY:: December 19, 1994
ORGANIZATION:: Stanford University, Computer Systems Laboratory
       TITLE:: Multipliers and Datapaths
        TYPE:: Technical Report
      AUTHOR:: Al-Twaijry, Hesham
      AUTHOR:: Flynn, Michael J.
        DATE:: December 1994
       PAGES:: 23
    ABSTRACT:: People traditionally have considered the number of counters
               in the critical path as the metric for the performance of a
               multiplier. This report presents the view that tree
               topologies which have the least number of levels do not
               always give the fastest possible multiplier when constrained
               to be part of a microprocessor. It proposes two new
               topologies: hybrid structure and higher order arrays which
               are faster than conventional tree topologies for typical
               datapaths.
       NOTES:: [Adminitrivia V1/Prg/19941219]
         END:: STAN//CSL-TR-94-654