Average Error: 0.3 → 0.2
Time: 5.9s
Precision: 64
\[\frac{\left(x.re \cdot y.im\right)}{\left(x.im \cdot y.re\right)}\]
↓
\[\left(\mathsf{qma}\left(\left(\left(x.re \cdot y.im\right)\right), x.im, y.re\right)\right)\]
\frac{\left(x.re \cdot y.im\right)}{\left(x.im \cdot y.re\right)}
↓
\left(\mathsf{qma}\left(\left(\left(x.re \cdot y.im\right)\right), x.im, y.re\right)\right)
double f(double x_re, double x_im, double y_re, double y_im) {
        double r2007218 = x_re;
        double r2007219 = y_im;
        double r2007220 = r2007218 * r2007219;
        double r2007221 = x_im;
        double r2007222 = y_re;
        double r2007223 = r2007221 * r2007222;
        double r2007224 = r2007220 + r2007223;
        return r2007224;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r2007225 = x_re;
        double r2007226 = y_im;
        double r2007227 = r2007225 * r2007226;
        double r2007228 = /*Error: no posit support in C */;
        double r2007229 = x_im;
        double r2007230 = y_re;
        double r2007231 = /*Error: no posit support in C */;
        double r2007232 = /*Error: no posit support in C */;
        return r2007232;
}

Error

Bits error versus x.re

Bits error versus x.im

Bits error versus y.re

Bits error versus y.im

Derivation

  1. Initial program 0.3

    \[\frac{\left(x.re \cdot y.im\right)}{\left(x.im \cdot y.re\right)}\]
  2. Using strategy rm

  3. Applied introduce-quire0.3

    \[\leadsto \frac{\color{blue}{\left(\left(\left(x.re \cdot y.im\right)\right)\right)}}{\left(x.im \cdot y.re\right)}\]

  4. Applied insert-quire-fdp-add0.2

    \[\leadsto \color{blue}{\left(\mathsf{qma}\left(\left(\left(x.re \cdot y.im\right)\right), x.im, y.re\right)\right)}\]

  5. Final simplification0.2

    \[\leadsto \left(\mathsf{qma}\left(\left(\left(x.re \cdot y.im\right)\right), x.im, y.re\right)\right)\]

Reproduce

herbie shell --seed 2019158 
(FPCore (x.re x.im y.re y.im)
  :name "_multiplyComplex, imaginary part"
  (+.p16 (*.p16 x.re y.im) (*.p16 x.im y.re)))