Average Error: 0.3 → 0.2
Time: 6.1s
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 r1966880 = x_re;
        double r1966881 = y_im;
        double r1966882 = r1966880 * r1966881;
        double r1966883 = x_im;
        double r1966884 = y_re;
        double r1966885 = r1966883 * r1966884;
        double r1966886 = r1966882 + r1966885;
        return r1966886;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r1966887 = x_re;
        double r1966888 = y_im;
        double r1966889 = r1966887 * r1966888;
        double r1966890 = /*Error: no posit support in C */;
        double r1966891 = x_im;
        double r1966892 = y_re;
        double r1966893 = /*Error: no posit support in C */;
        double r1966894 = /*Error: no posit support in C */;
        return r1966894;
}

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 2019168 
(FPCore (x.re x.im y.re y.im)
  :name "_multiplyComplex, imaginary part"
  (+.p16 (*.p16 x.re y.im) (*.p16 x.im y.re)))