Fast Fourier Transform
#
DescriptionThe signal processing block FFT
calculates the Fast Fourier Transform of an input.
#
InputThe input is MxN
.
#
OutputThe output is KxN
which is the FFT of the input signal MxN
. The size K
is dependent on the mode and number
of points of the FFT.
#
AttributesAttribute | Value |
---|---|
Name | FFT |
Mode | Full |
Points | โ 8192 |
Window | Rectangle |
Overlap | โ 0 |
Channels | 1 |
Values with โ can receive external input.
#
NameName specifies the name of the block.
#
ModeMode specifies the output of the FFT. The mode can either be Full
which produces the full point FFT, or Half
which produces a N/2-1 point FFT multiplied by two to give the correct level.
#
PointsPoints is the number of points in the FFT.
If the number of points is larger than the inputs M
, the input M
is zeropadded. If the number of points is lower
than the inputs M
then an average of multiple FFT's is calculated.
#
WindowWindow species the windowing used in the FFT. This can be chosen to one of the following:
Barthann
, Bartlett
, Blackman
, Blackmanharris
, Bohman
, Boxcar
, Cosine
, Flattop
, Hamming
, Hanning
, Nuttall
, Rectangle
, Triangle
.
#
OverlapOverlap specifies the overlap in points if multiple FFT are calculated.
#
ChannelsChannels specifies the number of input(s)/output(s) the block will have.