Path: utzoo!utgpu!jarvis.csri.toronto.edu!clyde.concordia.ca!uunet!deimos!ux1.cso.uiuc.edu!ux1.cso.uiuc.edu!uxh.cso.uiuc.edu!lin
From: lin@uxh.cso.uiuc.edu
Newsgroups: comp.arch
Subject: Help needed
Message-ID: <9700001@uxh.cso.uiuc.edu>
Date: 5 Jan 90 01:38:29 GMT
Lines: 13
Nf-ID: #N:uxh.cso.uiuc.edu:9700001:000:444
Nf-From: uxh.cso.uiuc.edu!lin    Jan  4 09:34:00 1990



	Can anyone kindly answer the question and give me some reference
to the question? Can the speed of an integer multiplier be made as fast as
an integer adder? If possible, how many gates are required to implement
the integer multiplier? If it is not possible, what is the smallest ratio 
of their speed? For simplicity, let's consider an 8 bits integer 
multiplier. Thanks very much in advance.

-Liangchien

E-mail
buddism@ei.ecn.purdue.edu