Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site mmintl.UUCP
Path: utzoo!linus!decvax!genrad!panda!talcott!harvard!seismo!cmcl2!philabs!pwa-b!mmintl!franka
From: franka@mmintl.UUCP (Frank Adams)
Newsgroups: net.arch
Subject: Re: Re: RISC (really on multiplication d
Message-ID: <511@mmintl.UUCP>
Date: Mon, 22-Jul-85 15:58:24 EDT
Article-I.D.: mmintl.511
Posted: Mon Jul 22 15:58:24 1985
Date-Received: Sun, 28-Jul-85 07:11:24 EDT
References: <149@mips.UUCP> <600005@pbear.UUCP> <493@mmintl.UUCP> <378@utastro.UUCP>
Reply-To: franka@mmintl.UUCP (Frank Adams)
Organization: Multimate International, E. Hartford, CT
Lines: 13


[Me]
>> I would guess, conservatively, that well over 90% of the integer multiplies
>> that are done generate a result with no more bits than the larger of the
>> two operands.

[Ed Nather]
>I didn't know that over 90% of multiplication operations were multiplying
>something by 1.  Wow.  You learn something new on the net every day!

Are you being intentionally obtuse?  The number of bits in an operand is
the number of bits being used to store the operand, not the number of
significant bits in the operand.  Sheesh.