Average Error: 1.1 → 1.0
Time: 25.3s
Precision: 64
\[\frac{\left(\frac{\left(x.re \cdot y.re\right)}{\left(x.im \cdot y.im\right)}\right)}{\left(\frac{\left(y.re \cdot y.re\right)}{\left(y.im \cdot y.im\right)}\right)}\]
↓
\[\frac{\left(\mathsf{qma}\left(\left(\left(x.re \cdot y.re\right)\right), x.im, y.im\right)\right)}{\left(\mathsf{qma}\left(\left(\left(y.re \cdot y.re\right)\right), y.im, y.im\right)\right)}\]
\frac{\left(\frac{\left(x.re \cdot y.re\right)}{\left(x.im \cdot y.im\right)}\right)}{\left(\frac{\left(y.re \cdot y.re\right)}{\left(y.im \cdot y.im\right)}\right)}
↓
\frac{\left(\mathsf{qma}\left(\left(\left(x.re \cdot y.re\right)\right), x.im, y.im\right)\right)}{\left(\mathsf{qma}\left(\left(\left(y.re \cdot y.re\right)\right), y.im, y.im\right)\right)}
double f(double x_re, double x_im, double y_re, double y_im) {
        double r746142 = x_re;
        double r746143 = y_re;
        double r746144 = r746142 * r746143;
        double r746145 = x_im;
        double r746146 = y_im;
        double r746147 = r746145 * r746146;
        double r746148 = r746144 + r746147;
        double r746149 = r746143 * r746143;
        double r746150 = r746146 * r746146;
        double r746151 = r746149 + r746150;
        double r746152 = r746148 / r746151;
        return r746152;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r746153 = x_re;
        double r746154 = y_re;
        double r746155 = r746153 * r746154;
        double r746156 = /*Error: no posit support in C */;
        double r746157 = x_im;
        double r746158 = y_im;
        double r746159 = /*Error: no posit support in C */;
        double r746160 = /*Error: no posit support in C */;
        double r746161 = r746154 * r746154;
        double r746162 = /*Error: no posit support in C */;
        double r746163 = /*Error: no posit support in C */;
        double r746164 = /*Error: no posit support in C */;
        double r746165 = r746160 / r746164;
        return r746165;
}

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 1.1

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

  3. Applied introduce-quire1.1

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

  4. Applied insert-quire-fdp-add1.1

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

  6. Applied introduce-quire1.1

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

  7. Applied insert-quire-fdp-add1.0

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

  8. Final simplification1.0

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

Reproduce

herbie shell --seed 2019153 
(FPCore (x.re x.im y.re y.im)
  :name "_divideComplex, real part"
  (/.p16 (+.p16 (*.p16 x.re y.re) (*.p16 x.im y.im)) (+.p16 (*.p16 y.re y.re) (*.p16 y.im y.im))))