From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 107079,183ebe04e93f0506 X-Google-Attributes: gid107079,public X-Google-Thread: 103376,183ebe04e93f0506 X-Google-Attributes: gid103376,public From: mheaney@ni.net (Matthew Heaney) Subject: Re: fixed point vs floating point Date: 1997/11/22 Message-ID: #1/1 X-Deja-AN: 291676163 Distribution: inet References: Organization: Estormza Software Newsgroups: comp.lang.ada,sci.math.num-analysis Date: 1997-11-22T00:00:00+00:00 List-Id: In article , dewar@merv.cs.nyu.edu (Robert Dewar) wrote: >Sure if you never do multiplications, then the penalty for fixed-point >can be close to zero (compared with flaoting-point), unless of course >you want more than 32 bits of precision and you are on a 32 bit machine, >then fixed-point gets very expensive. Let's change the problem a bit. What's more expensive: to calculate the sine of a fixed point with a binary small, or to calculate the sine of a floating point? What about making the fixed point 32 bits instead of 64 - will that make it more efficient? That processor Intermetrics is building an Ada compiler for (SHARC, or something like that) comes with "fixed point math in hardware." Will that make any difference in efficiency? BTW: how do I calculate the sine of a fixed point number? -------------------------------------------------------------------- Matthew Heaney Software Development Consultant (818) 985-1271