Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.1 6/24/83 (MC840302); site turing.UUCP Path: utzoo!watmath!clyde!burl!ulysses!allegra!mit-eddie!godot!harvard!seismo!mcvax!turing!dik From: dik@turing.UUCP Newsgroups: net.lang.c Subject: Re: Re: C language hacking Message-ID: <228@turing.UUCP> Date: Fri, 30-Nov-84 13:46:21 EST Article-I.D.: turing.228 Posted: Fri Nov 30 13:46:21 1984 Date-Received: Sun, 2-Dec-84 04:06:26 EST References: <9000031@uiucdcsb.UUCP> Organization: CWI, Amsterdam Lines: 16 Apparently-To: rnews@mcvax.LOCAL > A multiplication takes only 1 add > and shift per bit, ..... Oh yes, but you can have a lot of parallelism there, so the time needed for a 32*32 bit multiply is comparable to about 5 adds. In contrast, the CORDIC methods allow also some parallelism, but the timing is still one bit in about one add time. -- dik t. winter centrum voor wiskunde en informatica postbus 4079 1009 AB amsterdam nederland +31 20 592 4102 (polish your dutch) UUCP: decvax!mcvax!turing!dik