High Throughput Math Nodes

Achieve high throughput rates when performing fixed-point math and analysis.

Accumulator
Accumulates or decrements the values of x. The node has a signed mode and unsigned mode.
AddSub
Implements an adder-subtractor that operates on bit patterns.
DSP48
Maps a DSP48 interface to an available DSP48 slice on a Xilinx FPGA target that calculates a customizable arithmetic equation or logic operation.
High Throughput Add
Computes the sum of two addends.
High Throughput Divide
Computes the quotient of two numbers.
High Throughput Exponential
Computes the value of e raised to a specified power.
High Throughput Inverse Tangent (2 Input)
Computes the arctangent of one value divided by another value (y/x). The arctangent is in pi radians, which use fewer FPGA resources than radians. To convert this value into radians, divide the result by pi.
High Throughput Multiply
Computes the product of two values.
High Throughput Natural Logarithm
Computes the base e natural logarithm of a specified input value.
High Throughput Polar to Rectangular
Converts polar coordinates to rectangular coordinates. You must specify the phase of the polar coordinates in pi radians, which use fewer FPGA resources than radians. To convert a radian value to pi radians, multiply the value by pi.
High Throughput Reciprocal
Computes 1/x.
High Throughput Rectangular to Polar
Converts rectangular coordinates to polar coordinates. This node returns the phase of the polar coordinates in pi radians, which use fewer FPGA resources than radians. To convert the phase into radians, divide the value by pi.
High Throughput Sine and Cosine
Computes both the sine and cosine of a specified value (x). You must specify x in pi radians, which use fewer FPGA resources than radians. To convert a radian value to pi radians, multiply the value by pi.
High Throughput Square Root
Computes the square root of a specified value (x).
High Throughput Subtract
Computes the difference between two values.