Computes the Discrete Sine Transform (DST) of the input sequence X. Wire data to the X input to determine the polymorphic instance to use or manually select the instance.


icon

1D DST

The one-dimensional Discrete Sine Transform DST {X} of a sequence X is defined as:

, k=0, 1, 2, …, N–1

where N is the length of the input sequence X, xn is the nth element of the input sequence X, and yk is the kth element of the output sequence DST {X}. This VI applies a fast DST algorithm instead of calculating the Discrete Sine Transform directly. LabVIEW implements this fast DST algorithm using an FFT-based technique.

2D DST

The two-dimensional Discrete Sine Transform DST {X} of a matrix X is defined as:

where M and N are the number of rows and columns, respectively, of the input matrix X. x(m, n) is the element of the input matrix X with row number m and column number n. y(u, v) is the element of the output matrix DST {X} with row number u and column number v. This VI performs a two-dimensional DST using the following two steps:

  1. Perform a one-dimensional DST row-by-row on the input matrix X. The output is Y'.
  2. Perform a one-dimensional DST column-by-column on Y'. The output is DST {X}.