Computes the real Laplace transform of a sequence.
The array describing the evenly sampled time signal.
The first element of this array belongs to t = 0, the last to t = end.
The instant in time of the last sample.
The entire sample interval is between 0 and end.
Error conditions that occur before this node runs. The node responds to this input according to standard error behavior.
Default: No error
The result of the Laplace transform as an array.
Error information. The node produces this output according to standard error behavior.
The real Laplace transform of a real signal x(s) is defined by the following equation:
for real .
The discrete version of the Laplace transform of a discretely and evenly-sampled signal is a generation of the above continuous version.
The definition of the Laplace transform is not of much use if the time signal increases rapidly with the time. The discrete version of the Laplace transform cannot fully detect the convergence behavior of the original definition.
The discrete version of the Laplace transform is computationally expensive. An efficient strategy for the discrete Laplace transform is based on the fast fractional Fourier transform (FFFT). The definition of the FFFT is as follows:
with an arbitrarily chosen complex alpha.
Where This Node Can Run:
Desktop OS: Windows
FPGA: Not supported