-
while packaging faust-2.74.6 for Debian, I tried to test the new `faust2comparator` with `faust2comparator foo.dsp -fx-size 48` as described in https://github.com/grame-cncm/faust/blob/b498ef5159a0a02…
-
The best way to do bulk few-limb arithmetic on real numbers seems to be to convert to fixed-point form for things like matrix multiplication, FFT and polynomial multiplication. This generally means us…
-
The README documents that this crate provides "Decimal fixed-point arithmetics", but the exponent is variable at run-time. Therefore, it seems like this crate actually provides an implementation of De…
-
Did anyone test to run the code using fixed-point arithmetic?
How was the results? What Q number format did you use?
Best regards
-
The Ceph code uses fixed point arithmetic for the bucket weights. That's why the u32 that is decoded looks wrong when compared to the Ceph odd tree output. Reference:https://github.com/ceph/ceph/blob/…
-
It should only specify the number of total bits and number of fractional bits. The functions it provides, should rather be implemented in a module called e.g. FixedPointArithmetic. Perhaps there is a …
-
- Find a suitable library for fixed-point arithmetic
- Integrate with CMake behind compile constant
- Add tests to check precision, particular in higher-valued calculations (+/- 10000)
- Test rend…
Helco updated
5 years ago
-
We should look into using fixed point arithmetic as it will be significantly faster and reduce our required ROM space
-
```Haskell
newtype (:%:) (int :: Type) (modulus :: Natural) = UnsafeMod int
```
This is the `Mod` type from #177 proof-of-concept
Motivation is to model things as what they are. For instance, in…
-
[Clang supports fixed point arithmetic](https://groups.google.com/g/llvm-dev/c/PKiQ0szeT8g) which was proposed in [ISO/IEC JTC1 SC22 WG14 N1169](https://www.open-std.org/jtc1/sc22/wg14/www/docs/n1169.…