fft                  package:stats                  R Documentation

_F_a_s_t _D_i_s_c_r_e_t_e _F_o_u_r_i_e_r _T_r_a_n_s_f_o_r_m

_D_e_s_c_r_i_p_t_i_o_n:

     Performs the Fast Fourier Transform of an array.

_U_s_a_g_e:

     fft(z, inverse = FALSE)
     mvfft(z, inverse = FALSE)

_A_r_g_u_m_e_n_t_s:

       z: a real or complex array containing the values to be
          transformed.

 inverse: if 'TRUE', the unnormalized inverse transform is computed
          (the inverse has a '+' in the exponent of e, but here, we do
          _not_ divide by '1/length(x)').

_V_a_l_u_e:

     When 'z' is a vector, the value computed and returned by 'fft' is
     the unnormalized univariate Fourier transform of the sequence of
     values in 'z'. When 'z' contains an array, 'fft' computes and
     returns the multivariate (spatial) transform.  If 'inverse' is
     'TRUE', the (unnormalized) inverse Fourier transform is returned,
     i.e., if 'y <- fft(z)', then 'z' is 'fft(y, inverse = TRUE) /
     length(y)'.

     By contrast, 'mvfft' takes a real or complex matrix as argument,
     and returns a similar shaped matrix, but with each column replaced
     by its discrete Fourier transform.  This is useful for analyzing
     vector-valued series.

     The FFT is fastest when the length of the series being transformed
     is highly composite (i.e., has many factors).  If this is not the
     case, the transform may take a long time to compute and will use a
     large amount of memory.

_R_e_f_e_r_e_n_c_e_s:

     Becker, R. A., Chambers, J. M. and Wilks, A. R. (1988) _The New S
     Language_. Wadsworth & Brooks/Cole.

     Singleton, R. C. (1979) Mixed Radix Fast Fourier Transforms, in
     _Programs for Digital Signal Processing_, IEEE Digital Signal
     Processing Committee eds. IEEE Press.

_S_e_e _A_l_s_o:

     'convolve', 'nextn'.

_E_x_a_m_p_l_e_s:

     x <- 1:4
     fft(x)
     fft(fft(x), inverse = TRUE)/length(x)