Performs the discrete differentiation of the sampled signal.
Sampled signal from time 0 to n1, where n is the number of elements in the sampled signal.
Differentiation method.
Name  Description 

2nd Order Central  The derivative of the sampled signal is defined by the following equation:
${y}_{i}=\frac{1}{2dt}({x}_{i+1}{x}_{i1})$
for i =0, 1, 2, ..., n1 where

4th Order Central  The derivative of the sampled signal is defined by the following equation:
${y}_{i}=\frac{1}{12dt}({x}_{i+2}+8{x}_{i+1}8{x}_{i1}{x}_{i2})$
for i =0, 1, 2, ..., n1 where

Forward  The derivative of the sampled signal is defined by the following equation:
${y}_{i}=\frac{1}{dt}({x}_{i+1}{x}_{i})$
for i =0, 1, 2, ..., n1 where

Backward  The derivative of the sampled signal is defined by the following equation:
${y}_{i}=\frac{1}{dt}({x}_{i}{x}_{i1})$
for i =0, 1, 2, ..., n1 where

Default: 2nd Order Central
Initial condition of the sampled signal in the differentiation calculation.
This node uses the first element of the initial condition if the differentiation method is 2nd Order Central or Forward. This node uses the first two elements in the initial condition if the differentiation method is 4th Order Central.
Final condition of the sampled signal in the differentiation calculation.
This node uses the first element in the final condition if the differentiation method is 2nd Order Central or Forward. This node uses the first two elements if the differentiation method is 4th Order Central.
Error conditions that occur before this node runs. The node responds to this input according to standard error behavior.
Default: No error
Sampling interval.
Default: 1
Derivative of the sampled signal.
The differentiation f(t) of a function F(t) is defined by the following equation.
Let Y represent the sampled output sequence dx(t)/dt.
If method is 2nd Order Central, Y is given by the following equation:
for i = 0, 1, 2, ..., n  1
where
If method is 4th Order Central, Y is given by the following equation:
for i = 0, 1, 2, ..., n  1,
where
If method is Forward, Y is given by the following equation:
for i = 0, 1, 2, ..., n  1
where n is the number of samples in x(t) and x_{n} is the first element in final condition.
If method is Backward, Y is given by the following equation:
for i = 0, 1, 2, ..., n  1
where n is the number of samples in x(t) and x_{1} is the first element in initial condition.
The initial condition and final condition minimize the error at the boundaries.
Where This Node Can Run:
Desktop OS: Windows
FPGA: Not supported