Xref: utzoo sci.math:14975 comp.theory:1506 Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!motcid!ellis From: ellis@motcid.UUCP (John T Ellis) Newsgroups: sci.math,comp.theory Subject: Summary - 32 bit ops on 8 bit machine Message-ID: <4645@orchid12.UUCP> Date: 6 Feb 91 13:59:38 GMT Followup-To: motcid!ellis@chg.mcd.mot.com (John T. Ellis) Organization: Motorola Inc. - Cellular Infrastructure Grp., Arlington Heights, IL 60004 Lines: 49 A while back I posted a request for literature, insights, information on doing 32 bit operations on an 8 bit machine. The responses were immediate and I thank you. Following is a list of people who responded and their summarized tips. I apologize for any errors in the list or tips. Again, thanks for all the help. {-------------------------------} From: uunet!turing.cs.rpi.edu!borcherb (Brian Borchers) From: uunet!stat.orst.edu!ross (David Ross) From: uunet!jalapeno.cs.wisc.edu!bach (Eric Bach) From: Piet van Oostrum From: John Halleck From: John Halleck - Tim Iverson iverson@xstor.com -/- uunet!xstor!iverson 2nd volume Knuth's Art of Computer Programming (Seminumerical Algorithms) Specifically, look at section 4.3, Multiple-Precision Arithmetic, and sub-section 4.3.1, The Classical Algorithms. He gives algorithms for doing addition, subtraction, multiplication, and division on N-place numbers (digits in an aritrary base; in your case, base 256) one "digit" at a time. {-------------------------------} Charles Rennolet charles@thurse.MN.ORG All you need to do is bit twiddle. {-------------------------------} From: L. Detweiler Generalize to base 255 and you have a byte based algorithm for division, multiplication, addition and subttraction. {-------------------------------} -- -------------------------------+------------------------------------------------ John T. Ellis 708-632-7857 | Always draw your curves, Motorola Cellular | then plot your reading. motcid!ellis@chg.mcd.mot.com |