That's indeed no straightforward maths, but that's how it works. SFP works with a 32bit number, 2^32. -2^31<0<2^31 . To make it more complex, that is not all correct: There is no zero. There is 2^31 negative values, and 2^31 positive values, making for a total 2^32, 32bit, resolution. This makes for one number offset in many situations that will become more clear (and frustrating;) as you play with it and need exact results. Also, on every addition you loose a bit of resolution: 2^31+2^31=2^31 here

It's funny maths, that's for sure. But if you get to know it a bit better, it becomes more workeable. You can compensate for it, it will only save some screen space in a patch if made in DP. Modular provides you with the same maths stuff as the SDK or DP. Creating more complex and correct math algorithms is quite difficult. People with experience in that specialised maths area don't come walking up to you everyday, let alone someone that can create atoms/modules for sharc DSP and makes music with it. Or do they?
Check out j9k again too, he made a comparator and a couple other math functions that work with audio signals.
A little bit more explanation on trigonometric functions (from very far down memory lane):
* sin a = cos (a-90')
* tg = sin / cos
These can relatively easy be made with the modules we have. More complex functions can be found on the web for lower bitdepths, as used in mobile telephony or speech analysis/synthesis applications, that info is available online and may give you an impression of the problems working with fixed point binary math.
Maybe ReD_MuZe can create some maths modules for the upcoming Flexor2 pack...
_________________
more has been done with less
<font size=-1>[ This Message was edited by: at0m on 2005-07-04 02:02 ]</font>