Path: utzoo!mnetor!uunet!husc6!bbn!rochester!PT.CS.CMU.EDU!andrew.cmu.edu!jk3k+
From: jk3k+@andrew.cmu.edu (Joseph G. Keane)
Newsgroups: comp.arch
Subject: super multipliers
Message-ID: <oW1nb5y00Xo74Lw0F3@andrew.cmu.edu>
Date: 3 Feb 88 15:01:25 GMT
References: <235@unicom.UUCP> <28200089@ccvaxa> <3127@phri.UUCP>,
	<230@m2.mfci.UUCP>
Organization: Carnegie Mellon University
Lines: 7
In-Reply-To: <230@m2.mfci.UUCP>



I've heard of a `super multiplier', a big gate-array which multiplies without 
any clocking.  I assume this was only integer multiplies, though.  Does anyone 
know if this has been done for floating point?  What are the fastest times 
(ns) that have been done for various multiplies?

--Joe