Xref: utzoo comp.theory:1479 sci.math:14871
Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!sdd.hp.com!spool2.mu.edu!uunet!motcid!ellis
From: ellis@motcid.UUCP (John T Ellis)
Newsgroups: comp.theory,sci.math
Subject: Algorithm for 32 bit arithmetic on 8 bit machine
Message-ID: <4594@orchid12.UUCP>
Date: 29 Jan 91 13:42:13 GMT
Followup-To: motcid@chg.mcd.mot.com (John T. Ellis)
Organization: Motorola Inc. - Cellular Infrastructure Div., Arlington Heights, IL 60004
Lines: 17


A question for the math/cs gurus out there.  I'm working on an 8 bit machine
but have run into the situation where I need 32 bit arithmetic ie mulitply and
divide.  I know the "largest" number I could ever receive from applying an operation is 31 bits.  

Is there anyone who has an algorithm, some insights into how to best accomplish
this, or leads on literature?  I'm sure I could figure it out, but I would 
rather not reinvent the wheel.

If there is interest, I will post a summary of responses.

Thanks.
-- 
-------------------------------+------------------------------------------------
  John T. Ellis 708-632-7857   | Line Printer paper is strongest
       Motorola Cellular       |      at the perforations. 
 motcid!ellis@chg.mcd.mot.com  |