Report Number: CSL-TR-94-654
Institution: Stanford University, Computer Systems Laboratory
Title: Multipliers and Datapaths
Author: Al-Twaijry, Hesham
Author: Flynn, Michael J.
Date: December 1994
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.