
Fast Fourier Transform. More...
Functions  
AFAPI array  ifft2Norm (const array &in, const double norm_factor, const dim_t odim0=0, const dim_t odim1=0) 
C++ Interface for inverse fast fourier transform on two dimensional signals. More...  
AFAPI void  ifft2InPlace (array &in, const double norm_factor=1) 
C++ Interface for fast fourier transform on two dimensional signals. More...  
AFAPI array  ifft2 (const array &in, const dim_t odim0=0, const dim_t odim1=0) 
C++ Interface for inverse fast fourier transform on two dimensional signals. More...  
AFAPI af_err  af_ifft2 (af_array *out, const af_array in, const double norm_factor, const dim_t odim0, const dim_t odim1) 
C Interface for inverse fast fourier transform on two dimensional signals. More...  
AFAPI af_err  af_ifft2_inplace (af_array in, const double norm_factor) 
C Interface for fast fourier transform on two dimensional signals. More...  
Fast Fourier Transform.
The Fast Fourier Transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) of a signal or array. This is most commonly used to convert data in the time (or space) domain to the frequency domain, Then, the inverse FFT (iFFT) is used to return the data to the original domain.
There are numerous algorithms to compute the FFT of an array, and the specifics of the algorithm depend on the target hardware. Most algorithms, however, use a CooleyTukey scheme in a divideandconquer approach.
AFAPI af_err af_ifft2  (  af_array *  out, 
const af_array  in,  
const double  norm_factor,  
const dim_t  odim0,  
const dim_t  odim1  
) 
C Interface for inverse fast fourier transform on two dimensional signals.
[out]  out  is the transformed array 
[in]  in  is the input array 
[in]  norm_factor  is the normalization factor with which the input is scaled after the transformation is applied 
[in]  odim0  is the length of output signals along first dimension  used to either truncate/pad the input 
[in]  odim1  is the length of output signals along second dimension  used to either truncate/pad the input 
C Interface for fast fourier transform on two dimensional signals.
[in,out]  in  is the input array on entry and the output of 2D inverse fourier transform on exit 
[in]  norm_factor  is the normalization factor with which the input is scaled after the transformation is applied 
in
must be a complex array C++ Interface for inverse fast fourier transform on two dimensional signals.
This version of fft function uses a default norm_factor parameter that is calculated internally based on the input signals.
[in]  in  is the input array 
[in]  odim0  is the length of output signals along first dimension  used to either truncate/pad the input 
[in]  odim1  is the length of output signals along second dimension  used to either truncate/pad the input 
C++ Interface for fast fourier transform on two dimensional signals.
[in,out]  in  is the input array on entry and the output of 2D inverse fourier transform on exit 
[in]  norm_factor  is the normalization factor with which the input is scaled after the transformation is applied 
in
must be complex AFAPI array af::ifft2Norm  (  const array &  in, 
const double  norm_factor,  
const dim_t  odim0 = 0 , 

const dim_t  odim1 = 0 

) 
C++ Interface for inverse fast fourier transform on two dimensional signals.
[in]  in  is the input array 
[in]  norm_factor  is the normalization factor with which the input is scaled after the transformation is applied 
[in]  odim0  is the length of output signals along first dimension  used to either truncate/pad the input 
[in]  odim1  is the length of output signals along second dimension  used to either truncate/pad the input 