Computes an in-place single-precision real discrete FFT, either from the spatial domain to the frequency domain (forward) or from the frequency domain to the spatial domain (inverse).
- iOS 4.0+
- macOS 10.0+
- Mac Catalyst 13.0+
- tvOS 9.0+
- watchOS 2.0+
Points to a structure initialized by a prior call to
v. The value supplied as parameter
DSP _create _fftsetup
Log2nof the setup function must equal or exceed the values supplied as parameters
Log2N1of this transform function.
Complex 2-dimensional input/output vector, i.e. a matrix.
Stride between elements in a row of
Stride between elements in a column of
C; should generally be allowed to default (by passing 0) unless the matrix is a submatrix. The default column stride equals the row stride multiplied by the column count. Thus, if
IC0is 1 and
IC1is 0, every element of the input /output matrix is processed. If
IC0is 2 and
strideis 0, every other element of each row is processed.
If not 0, parameter
IC1represents the distance between adjacent rows of the matrix.
The base 2 exponent of the number of columns to process for each row.
The base 2 exponent of the number of rows to process. For example, to process 64 rows of 128 columns, specify
Forward transforms read real input and write packed complex output. Inverse transforms read packed complex input and write real output. As a result of packing the frequency-domain data, spatial-domain data and its equivalent frequency-domain data have the same storage requirements.
where F is
Direction, N is two raised to
Log2N1, M is two raised to
Log2N0, and j is the square root of
Real data is stored in split complex form, with odd reals stored on the imaginary side of the split complex form and even reals stored on the real side.