Re: A85: Fast 8 bit multiply routine
[Prev][Next][Index][Thread]
Re: A85: Fast 8 bit multiply routine
On Mon, 18 Aug 1997 22:25:19 GMT mikep@anet-dfw.com (Michael Pearce)
writes:
>Wouldn't that routine be really slow when the number in b grows large?
Yes it would be slower, but since the most it would do is 255 loops(and
assembly is fast) it won't take that much time. Repeated addition would
seem to be slower than actually multiplying two numbers, but I read
somewhere that the IBM CPU MUL command is slower than repeated addition,
but takes less space. If you know that you want to multiply by a power
of 2 then shifting the bits would be the fastest method to use. Without
a multiplying opcode you have to resort to either addition or shifting(or
something else), whichever suits your programming needs.
Sincerely,
The Unibomer
Jared Ivey
Unibomer@Juno.com
Ham Call Sign: KF4BXL
The Unibomer's Shack:
http://www.geocities.com/SiliconValley/Vista/7342/
_______________________
| Florida Times Union |
|=======================|
| Unibomer Strikes Again|
| ~~~~~~~~~~~~~~~~~~~ |
| ~~~~~~~~~~~~~~~~~~~~~ |
| ~~~~~~~~~~~~~~~~~~~~~ |
| ~~~~~~~~~~~~~~~~~~~~~ |
| ~~~~~~~~~~~~~~~~~~~~• |
|_______________________|
References: