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

[Colin Paul Gloster <Colin_Paul_Gloster@ACM.org>]

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.

A worse way would be to use bitfields.