Version: current

Fast Fourier Transform

Description

The signal processing block FFT calculates the Fast Fourier Transform of an input.

MxNKxN

Input

The input is MxN.

Output

The 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.

Attributes

AttributeValue
NameFFT
ModeFull
Pointsโ˜ 8192
WindowRectangle
Overlapโ˜ 0
Channels1

Values with โ˜ can receive external input.

Name

Name specifies the name of the block.

Mode

Mode 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.

Points

Points 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.

Window

Window 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.

Overlap

Overlap specifies the overlap in points if multiple FFT are calculated.

Channels

Channels specifies the number of input(s)/output(s) the block will have.