C language hacking

[dik at turing.UUCP]

>					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