Average Error: 0.3 → 0.2
Time: 5.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 r363109 = x_re;
        double r363110 = y_im;
        double r363111 = r363109 * r363110;
        double r363112 = x_im;
        double r363113 = y_re;
        double r363114 = r363112 * r363113;
        double r363115 = r363111 + r363114;
        return r363115;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r363116 = x_re;
        double r363117 = y_im;
        double r363118 = r363116 * r363117;
        double r363119 = /*Error: no posit support in C */;
        double r363120 = x_im;
        double r363121 = y_re;
        double r363122 = /*Error: no posit support in C */;
        double r363123 = /*Error: no posit support in C */;
        return r363123;
}

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