Re: Simulation of fixed point in c WITH DIFFERENT BIT-WIDTH

[Gautier Write-only <gautier@fakeaddress.nil>]

Colin Paul Gloster:

> Mnamky posted to news:comp.lang.ada :
> 
> "Hi all;
> 
> Consider the following exaple
> y = x * b'
> 
> where x is 12-bit wordlength and 11-bit fraction
> and b is 16-bit wordlength and 14-bit fraction
> 
> simulation of this code is rather easy im Matlab but how could we do a
> full analysis of this code in C with a good precision?"
> 
> I fail to see the relevance of this to Ada. In C, you could use ints and
> interpret some bits as an integer and some bits as a vulgar fraction, as
> in computer games books for 386s and 486s (before Pentiums which had
> faster floating point support than integer support) in the 1990s, such
> as "Building a 3D Engine in C++" and La Mothe; Ratcliff; et al.,
> "Tricks of the Game Programming Gurus", SAMS Publishing.

Some people were perverse enough to do it even in Ada, e.g.:

  http://homepage.sunrise.ch/mysunrise/gdm/e3d_html/svgaeffe__adb.htm#258_13

Shocking, isn't it ?

The method was also useful for a short time with Pentiums, but before the 3D graphics cards, since you can make the FPU and the CPU work simultaneously. For grabbing "manually" (i.e. withouth 3D hardware) single pixels on a texture map, you also gain time by not using the FPU for each pixel: otherwise, you would have each time one FPU division, plus a conversion to an array index, which must be slower than a single integer addition for the same index.

G.