Subject: Re: [boost] Fixed point implicity
From: joel (joel.falcou_at_[hidden])
Date: 2009-07-02 09:58:52
> After algorithm development, during fixed point conversion (for implementation
> on a chip), I find that the following suffices:
> A = s[2,-3] 7 bits
> B = s[4,-2] 8 bits
> C = s[4,-3] 9 bits
> R = u[7,2] with saturation and truncation 6 bits
> where s[a,b] is a signed type holding bits for 2^a, 2^(a-1),...,2^b and u[a,b]
> is the corresponding unsigned type.
Let me ask a layman question then : are those ranges complex to evaluate
? If not, maybe can we do it at compile-time so we knwo we always
geenrate the proper sufficent bit enabled representation.
-- ___________________________________________ Joel Falcou - Assistant Professor PARALL Team - LRI - Universite Paris Sud XI Tel : (+33)1 69 15 66 35
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk