
ifft - inverse fast Fourier transformation

Calling sequence:
ifft(list, m)

Parameter:
list   --  list of numbers with 2^m entries
m      --  non-negative integer

Summary:

ifft calculates the inverse fast Fourier transformation of the given listlist.
The list must contain 2^m numerical elements. The result is also a list with
2^m numbers.

>>  A := [1.0, 2.0, 3.0, 4.0]:
   fft(A, 2):
   ifft(%, 2);

     [1.0, 2.0, 3.0, 4.0]

See also:  fft

