Only practical table would be 8x8 bits. But a 8x8 I can do in very short time... Problem is a 64x64 byte (512 bit) calculation... Even with a mul command I'd need 64*64 multiplications! (Worst case...) I would also need a ton of additions as each addition of the separate factor multiplicatons needs to be summed into the result and any overflow of the additions needs to be propagated, giving even more additions. I've looket at an Atmel chip for the mul command and it didn't make the calculations much faster... KreAture ----- Original Message ----- From: "Spehro Pefhany" To: Sent: Thursday, January 16, 2003 7:39 PM Subject: Re: [PIC]: Fastest possible 512 bit multiply ??? > At 07:30 PM 1/16/03 +0100, you wrote: > >So, to do a very fast 512 bit times any 512 bit number I should use a table? > >LOL, will you make it fit in the PIC for me? > > > >That table wouldn't fit on my hard-drive! > > No, silly, you use a smaller table and do partial products. It remains to be > seen whether it would actually be faster, but the 256 bytes for a 4 x 4 table > is not likely an issue. > > Best regards, > > Spehro Pefhany --"it's the network..." "The Journey is the reward" > speff@interlog.com Info for manufacturers: http://www.trexon.com > Embedded software/hardware/analog Info for designers: http://www.speff.com > > -- > http://www.piclist.com hint: To leave the PICList > mailto:piclist-unsubscribe-request@mitvma.mit.edu > -- http://www.piclist.com hint: The list server can filter out subtopics (like ads or off topics) for you. See http://www.piclist.com/#topics