Re: Signed multiplication

From: Ullrich von Bassewitz <uz_at_musoftware.de>
Date: Mon, 9 Nov 2009 21:28:43 +0100
Message-ID: <20091109202843.GC19761@trixie.musoftware.de>
Hi!

On Sat, Nov 07, 2009 at 12:12:56PM +0100, Spiro Trikaliotis wrote:
> Have you had a look at the Booth Algorithm?

Not before I read your mail. I've checked it now and while I haven't written
an implementation, I doubt that it is really well suited for the 6502 for two
reasons: It needs more memory (zero page, in this case), and addititions in the
loop are 32 bit instead of 16 bit, which will at least loose part of the
cycles gained by having to do less additions.

But thanks anyway, I've learned something new :-)

Regards


        Uz


-- 
Ullrich von Bassewitz                                  uz@musoftware.de

       Message was sent through the cbm-hackers mailing list
Received on 2009-11-09 21:00:03

Archive generated by hypermail 2.2.0.