Numeric.Signal.Multichannel:$cget from hsignal-0.2.7.1

Percentage Accurate: 97.7% → 97.7%

Time: 5.1s

Alternatives: 7

Speedup: 1.0×

• 25.1% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \frac{x}{y} \cdot \left(z - t\right) + t \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (+ (* (/ x y) (- z t)) t))

C

double code(double x, double y, double z, double t) {
	return ((x / y) * (z - t)) + t;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = ((x / y) * (z - t)) + t
end function

Java

public static double code(double x, double y, double z, double t) {
	return ((x / y) * (z - t)) + t;
}

Python

def code(x, y, z, t):
	return ((x / y) * (z - t)) + t

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(x / y) * Float64(z - t)) + t)
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = ((x / y) * (z - t)) + t;
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(x / y), $MachinePrecision] * N[(z - t), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]

Initial Program: 97.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x}{y} \cdot \left(z - t\right) + t \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (+ (* (/ x y) (- z t)) t))

C

double code(double x, double y, double z, double t) {
	return ((x / y) * (z - t)) + t;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = ((x / y) * (z - t)) + t
end function

Java

public static double code(double x, double y, double z, double t) {
	return ((x / y) * (z - t)) + t;
}

Python

def code(x, y, z, t):
	return ((x / y) * (z - t)) + t

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(x / y) * Float64(z - t)) + t)
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = ((x / y) * (z - t)) + t;
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(x / y), $MachinePrecision] * N[(z - t), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]

Alternative 1: 97.7% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\frac{x}{y}, z - t, t\right) \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (fma (/ x y) (- z t) t))

C

double code(double x, double y, double z, double t) {
	return fma((x / y), (z - t), t);
}

Julia

function code(x, y, z, t)
	return fma(Float64(x / y), Float64(z - t), t)
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(x / y), $MachinePrecision] * N[(z - t), $MachinePrecision] + t), $MachinePrecision]

Derivation

1. Initial program 98.4%

   \[\frac{x}{y} \cdot \left(z - t\right) + t \]
2. Step-by-step derivation

   1. fma-def 98.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{x}{y}, z - t, t\right)} \]

3. Simplified 98.4%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{x}{y}, z - t, t\right)} \]

4. Final simplification 98.4%

   \[\leadsto \mathsf{fma}\left(\frac{x}{y}, z - t, t\right) \]

Alternative 2: 85.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.05 \cdot 10^{-25}:\\ \;\;\;\;t + \frac{x}{y} \cdot z\\ \mathbf{elif}\;z \leq 4.8 \cdot 10^{-125}:\\ \;\;\;\;t - \frac{x}{y} \cdot t\\ \mathbf{else}:\\ \;\;\;\;t + \frac{z}{\frac{y}{x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -1.05e-25)
   (+ t (* (/ x y) z))
   (if (<= z 4.8e-125) (- t (* (/ x y) t)) (+ t (/ z (/ y x))))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -1.05e-25) {
		tmp = t + ((x / y) * z);
	} else if (z <= 4.8e-125) {
		tmp = t - ((x / y) * t);
	} else {
		tmp = t + (z / (y / x));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (z <= (-1.05d-25)) then
        tmp = t + ((x / y) * z)
    else if (z <= 4.8d-125) then
        tmp = t - ((x / y) * t)
    else
        tmp = t + (z / (y / x))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -1.05e-25) {
		tmp = t + ((x / y) * z);
	} else if (z <= 4.8e-125) {
		tmp = t - ((x / y) * t);
	} else {
		tmp = t + (z / (y / x));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -1.05e-25:
		tmp = t + ((x / y) * z)
	elif z <= 4.8e-125:
		tmp = t - ((x / y) * t)
	else:
		tmp = t + (z / (y / x))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= -1.05e-25)
		tmp = Float64(t + Float64(Float64(x / y) * z));
	elseif (z <= 4.8e-125)
		tmp = Float64(t - Float64(Float64(x / y) * t));
	else
		tmp = Float64(t + Float64(z / Float64(y / x)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (z <= -1.05e-25)
		tmp = t + ((x / y) * z);
	elseif (z <= 4.8e-125)
		tmp = t - ((x / y) * t);
	else
		tmp = t + (z / (y / x));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[z, -1.05e-25], N[(t + N[(N[(x / y), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 4.8e-125], N[(t - N[(N[(x / y), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision], N[(t + N[(z / N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.05000000000000001e-25

   1. Initial program 98.4%

      \[\frac{x}{y} \cdot \left(z - t\right) + t \]

   2. Taylor expanded in z around inf 85.0%

      \[\leadsto \color{blue}{\frac{z \cdot x}{y}} + t \]
   3. Step-by-step derivation

      1. associate-*r/ 90.6%

         \[\leadsto \color{blue}{z \cdot \frac{x}{y}} + t \]

   4. Simplified 90.6%

      \[\leadsto \color{blue}{z \cdot \frac{x}{y}} + t \]

   if -1.05000000000000001e-25 < z < 4.8000000000000003e-125

   1. Initial program 98.0%

      \[\frac{x}{y} \cdot \left(z - t\right) + t \]

   2. Taylor expanded in z around 0 88.9%

      \[\leadsto \color{blue}{t + -1 \cdot \frac{t \cdot x}{y}} \]
   3. Step-by-step derivation

      1. mul-1-neg 88.9%

         \[\leadsto t + \color{blue}{\left(-\frac{t \cdot x}{y}\right)} \]

      2. unsub-neg 88.9%

         \[\leadsto \color{blue}{t - \frac{t \cdot x}{y}} \]

      3. associate-*r/ 91.2%

         \[\leadsto t - \color{blue}{t \cdot \frac{x}{y}} \]

   4. Simplified 91.2%

      \[\leadsto \color{blue}{t - t \cdot \frac{x}{y}} \]

   if 4.8000000000000003e-125 < z

   1. Initial program 98.9%

      \[\frac{x}{y} \cdot \left(z - t\right) + t \]

   2. Taylor expanded in z around inf 86.0%

      \[\leadsto \color{blue}{\frac{z \cdot x}{y}} + t \]
   3. Step-by-step derivation

      1. associate-/l* 90.3%

         \[\leadsto \color{blue}{\frac{z}{\frac{y}{x}}} + t \]

   4. Simplified 90.3%

      \[\leadsto \color{blue}{\frac{z}{\frac{y}{x}}} + t \]
3. Recombined 3 regimes into one program.

4. Final simplification 90.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.05 \cdot 10^{-25}:\\ \;\;\;\;t + \frac{x}{y} \cdot z\\ \mathbf{elif}\;z \leq 4.8 \cdot 10^{-125}:\\ \;\;\;\;t - \frac{x}{y} \cdot t\\ \mathbf{else}:\\ \;\;\;\;t + \frac{z}{\frac{y}{x}}\\ \end{array} \]

Alternative 3: 86.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.25 \cdot 10^{-25}:\\ \;\;\;\;t + \frac{x}{y} \cdot z\\ \mathbf{elif}\;z \leq 2 \cdot 10^{-122}:\\ \;\;\;\;t - \frac{t}{\frac{y}{x}}\\ \mathbf{else}:\\ \;\;\;\;t + \frac{z}{\frac{y}{x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -1.25e-25)
   (+ t (* (/ x y) z))
   (if (<= z 2e-122) (- t (/ t (/ y x))) (+ t (/ z (/ y x))))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -1.25e-25) {
		tmp = t + ((x / y) * z);
	} else if (z <= 2e-122) {
		tmp = t - (t / (y / x));
	} else {
		tmp = t + (z / (y / x));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (z <= (-1.25d-25)) then
        tmp = t + ((x / y) * z)
    else if (z <= 2d-122) then
        tmp = t - (t / (y / x))
    else
        tmp = t + (z / (y / x))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -1.25e-25) {
		tmp = t + ((x / y) * z);
	} else if (z <= 2e-122) {
		tmp = t - (t / (y / x));
	} else {
		tmp = t + (z / (y / x));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -1.25e-25:
		tmp = t + ((x / y) * z)
	elif z <= 2e-122:
		tmp = t - (t / (y / x))
	else:
		tmp = t + (z / (y / x))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= -1.25e-25)
		tmp = Float64(t + Float64(Float64(x / y) * z));
	elseif (z <= 2e-122)
		tmp = Float64(t - Float64(t / Float64(y / x)));
	else
		tmp = Float64(t + Float64(z / Float64(y / x)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (z <= -1.25e-25)
		tmp = t + ((x / y) * z);
	elseif (z <= 2e-122)
		tmp = t - (t / (y / x));
	else
		tmp = t + (z / (y / x));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[z, -1.25e-25], N[(t + N[(N[(x / y), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2e-122], N[(t - N[(t / N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t + N[(z / N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.2499999999999999e-25

   1. Initial program 98.4%

      \[\frac{x}{y} \cdot \left(z - t\right) + t \]

   2. Taylor expanded in z around inf 85.0%

      \[\leadsto \color{blue}{\frac{z \cdot x}{y}} + t \]
   3. Step-by-step derivation

      1. associate-*r/ 90.6%

         \[\leadsto \color{blue}{z \cdot \frac{x}{y}} + t \]

   4. Simplified 90.6%

      \[\leadsto \color{blue}{z \cdot \frac{x}{y}} + t \]

   if -1.2499999999999999e-25 < z < 2.00000000000000012e-122

   1. Initial program 98.0%

      \[\frac{x}{y} \cdot \left(z - t\right) + t \]

   2. Taylor expanded in z around 0 88.9%

      \[\leadsto \color{blue}{t + -1 \cdot \frac{t \cdot x}{y}} \]
   3. Step-by-step derivation

      1. mul-1-neg 88.9%

         \[\leadsto t + \color{blue}{\left(-\frac{t \cdot x}{y}\right)} \]

      2. unsub-neg 88.9%

         \[\leadsto \color{blue}{t - \frac{t \cdot x}{y}} \]

      3. associate-/l* 91.3%

         \[\leadsto t - \color{blue}{\frac{t}{\frac{y}{x}}} \]

      4. associate-/r/ 87.6%

         \[\leadsto t - \color{blue}{\frac{t}{y} \cdot x} \]

   4. Simplified 87.6%

      \[\leadsto \color{blue}{t - \frac{t}{y} \cdot x} \]
   5. Step-by-step derivation

      1. associate-*l/ 88.9%

         \[\leadsto t - \color{blue}{\frac{t \cdot x}{y}} \]

      2. associate-/l* 91.3%

         \[\leadsto t - \color{blue}{\frac{t}{\frac{y}{x}}} \]

   6. Applied egg-rr 91.3%

      \[\leadsto t - \color{blue}{\frac{t}{\frac{y}{x}}} \]

   if 2.00000000000000012e-122 < z

   1. Initial program 98.9%

      \[\frac{x}{y} \cdot \left(z - t\right) + t \]

   2. Taylor expanded in z around inf 86.0%

      \[\leadsto \color{blue}{\frac{z \cdot x}{y}} + t \]
   3. Step-by-step derivation

      1. associate-/l* 90.3%

         \[\leadsto \color{blue}{\frac{z}{\frac{y}{x}}} + t \]

   4. Simplified 90.3%

      \[\leadsto \color{blue}{\frac{z}{\frac{y}{x}}} + t \]
3. Recombined 3 regimes into one program.

4. Final simplification 90.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.25 \cdot 10^{-25}:\\ \;\;\;\;t + \frac{x}{y} \cdot z\\ \mathbf{elif}\;z \leq 2 \cdot 10^{-122}:\\ \;\;\;\;t - \frac{t}{\frac{y}{x}}\\ \mathbf{else}:\\ \;\;\;\;t + \frac{z}{\frac{y}{x}}\\ \end{array} \]

Alternative 4: 97.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ t + \frac{x}{y} \cdot \left(z - t\right) \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (+ t (* (/ x y) (- z t))))

C

double code(double x, double y, double z, double t) {
	return t + ((x / y) * (z - t));
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = t + ((x / y) * (z - t))
end function

Java

public static double code(double x, double y, double z, double t) {
	return t + ((x / y) * (z - t));
}

Python

def code(x, y, z, t):
	return t + ((x / y) * (z - t))

Julia

function code(x, y, z, t)
	return Float64(t + Float64(Float64(x / y) * Float64(z - t)))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = t + ((x / y) * (z - t));
end

Wolfram

code[x_, y_, z_, t_] := N[(t + N[(N[(x / y), $MachinePrecision] * N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 98.4%

   \[\frac{x}{y} \cdot \left(z - t\right) + t \]

2. Final simplification 98.4%

   \[\leadsto t + \frac{x}{y} \cdot \left(z - t\right) \]

Alternative 5: 76.8% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ t + \frac{x}{y} \cdot z \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (+ t (* (/ x y) z)))

C

double code(double x, double y, double z, double t) {
	return t + ((x / y) * z);
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = t + ((x / y) * z)
end function

Java

public static double code(double x, double y, double z, double t) {
	return t + ((x / y) * z);
}

Python

def code(x, y, z, t):
	return t + ((x / y) * z)

Julia

function code(x, y, z, t)
	return Float64(t + Float64(Float64(x / y) * z))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = t + ((x / y) * z);
end

Wolfram

code[x_, y_, z_, t_] := N[(t + N[(N[(x / y), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 98.4%

   \[\frac{x}{y} \cdot \left(z - t\right) + t \]

2. Taylor expanded in z around inf 73.6%

   \[\leadsto \color{blue}{\frac{z \cdot x}{y}} + t \]
3. Step-by-step derivation

   1. associate-*r/ 78.4%

      \[\leadsto \color{blue}{z \cdot \frac{x}{y}} + t \]

4. Simplified 78.4%

   \[\leadsto \color{blue}{z \cdot \frac{x}{y}} + t \]

5. Final simplification 78.4%

   \[\leadsto t + \frac{x}{y} \cdot z \]

Alternative 6: 76.6% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ t + \frac{z}{\frac{y}{x}} \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (+ t (/ z (/ y x))))

C

double code(double x, double y, double z, double t) {
	return t + (z / (y / x));
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = t + (z / (y / x))
end function

Java

public static double code(double x, double y, double z, double t) {
	return t + (z / (y / x));
}

Python

def code(x, y, z, t):
	return t + (z / (y / x))

Julia

function code(x, y, z, t)
	return Float64(t + Float64(z / Float64(y / x)))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = t + (z / (y / x));
end

Wolfram

code[x_, y_, z_, t_] := N[(t + N[(z / N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 98.4%

   \[\frac{x}{y} \cdot \left(z - t\right) + t \]

2. Taylor expanded in z around inf 73.6%

   \[\leadsto \color{blue}{\frac{z \cdot x}{y}} + t \]
3. Step-by-step derivation

   1. associate-/l* 78.4%

      \[\leadsto \color{blue}{\frac{z}{\frac{y}{x}}} + t \]

4. Simplified 78.4%

   \[\leadsto \color{blue}{\frac{z}{\frac{y}{x}}} + t \]

5. Final simplification 78.4%

   \[\leadsto t + \frac{z}{\frac{y}{x}} \]

Alternative 7: 37.8% accurate, 9.0× speedup

Math

\[\begin{array}{l} \\ t \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 t)

C

double code(double x, double y, double z, double t) {
	return t;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = t
end function

Java

public static double code(double x, double y, double z, double t) {
	return t;
}

Python

def code(x, y, z, t):
	return t

Julia

function code(x, y, z, t)
	return t
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = t;
end

Wolfram

code[x_, y_, z_, t_] := t

Derivation

1. Initial program 98.4%

   \[\frac{x}{y} \cdot \left(z - t\right) + t \]

2. Taylor expanded in x around 0 37.8%

   \[\leadsto \color{blue}{t} \]

3. Final simplification 37.8%

   \[\leadsto t \]

Developer target: 97.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x}{y} \cdot \left(z - t\right) + t\\ \mathbf{if}\;z < 2.759456554562692 \cdot 10^{-282}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;z < 2.326994450874436 \cdot 10^{-110}:\\ \;\;\;\;x \cdot \frac{z - t}{y} + t\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (+ (* (/ x y) (- z t)) t)))
   (if (< z 2.759456554562692e-282)
     t_1
     (if (< z 2.326994450874436e-110) (+ (* x (/ (- z t) y)) t) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = ((x / y) * (z - t)) + t;
	double tmp;
	if (z < 2.759456554562692e-282) {
		tmp = t_1;
	} else if (z < 2.326994450874436e-110) {
		tmp = (x * ((z - t) / y)) + t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = ((x / y) * (z - t)) + t
    if (z < 2.759456554562692d-282) then
        tmp = t_1
    else if (z < 2.326994450874436d-110) then
        tmp = (x * ((z - t) / y)) + t
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = ((x / y) * (z - t)) + t;
	double tmp;
	if (z < 2.759456554562692e-282) {
		tmp = t_1;
	} else if (z < 2.326994450874436e-110) {
		tmp = (x * ((z - t) / y)) + t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = ((x / y) * (z - t)) + t
	tmp = 0
	if z < 2.759456554562692e-282:
		tmp = t_1
	elif z < 2.326994450874436e-110:
		tmp = (x * ((z - t) / y)) + t
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(Float64(x / y) * Float64(z - t)) + t)
	tmp = 0.0
	if (z < 2.759456554562692e-282)
		tmp = t_1;
	elseif (z < 2.326994450874436e-110)
		tmp = Float64(Float64(x * Float64(Float64(z - t) / y)) + t);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = ((x / y) * (z - t)) + t;
	tmp = 0.0;
	if (z < 2.759456554562692e-282)
		tmp = t_1;
	elseif (z < 2.326994450874436e-110)
		tmp = (x * ((z - t) / y)) + t;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(N[(x / y), $MachinePrecision] * N[(z - t), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]}, If[Less[z, 2.759456554562692e-282], t$95$1, If[Less[z, 2.326994450874436e-110], N[(N[(x * N[(N[(z - t), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision], t$95$1]]]

Reproduce

herbie shell --seed 2023268 
(FPCore (x y z t)
  :name "Numeric.Signal.Multichannel:$cget from hsignal-0.2.7.1"
  :precision binary64

  :herbie-target
  (if (< z 2.759456554562692e-282) (+ (* (/ x y) (- z t)) t) (if (< z 2.326994450874436e-110) (+ (* x (/ (- z t) y)) t) (+ (* (/ x y) (- z t)) t)))

  (+ (* (/ x y) (- z t)) t))