CFFT2,ZFFT2(3) MathKeisan FFT routine CFFT2,ZFFT2(3)
NAME
cfft2, zfft2 - one-dimensional complex-to-complex FFT
SYNOPSIS
libfft.a
INTEGER init, ix, n
COMPLEX x(n), y(n)
REAL work(2*n+64)
CALL CFFT2 ( init, ix, n, x, work, y )
INTEGER init, ix, n
COMPLEX(kind=8) x(n), y(n)
REAL(kind=8) work(2*n+64)
CALL ZFFT2 ( init, ix, n, x, work, y )
libfft_64.a
INTEGER(kind=8) init, ix, n
COMPLEX(kind=8) x(n), y(n)
REAL(kind=8) work(2*n+64)
CALL CFFT2 ( init, ix, n, x, work, y )
INTEGER(kind=8) init, ix, n
COMPLEX(kind=8) x(n), y(n)
REAL(kind=8) work(2*n+64)
CALL ZFFT2 ( init, ix, n, x, work, y )
DESCRIPTION
This subroutine computes the one-dimensional discrete Fourier transform
of the given complex array x; the transformed data is stored in the
complex array y. If we take x and y to be dimensioned as x(0:n-1) and
y(0:n-1), the transform is expressed by the following formula:
n-1
y(k) = Sum x(j) * exp(isign*j*k*2*pi*i/n)
j=0
for k = 0, ..., n-1, where i = sqrt(-1).
In order to accomodate multiple calls of the same size to this routine,
an additional initialization step is required prior to the computation
of any transforms. Hence, whenever it is desired to use [CZ]FFT2 in a
program, it must be called at least twice.
Note that this routine currently provides only serial functionality.
ARGUMENTS
Input
init Option flag:
If init != 0, the routine is initialized for the given value of
n.
ix Determines the sign of the exponential in the transform. The
sign of the exponential in the transform is the same as the sign
of ix.
Not used if init != 0.
NOTE: This routine requires that ix != 0 if init = 0.
n Number of data points (n>0).
x Array of data to be transformed.
Not used if init != 0.
Working Storage
work Workspace for computing the transform.
Not used if init != 0.
Output
y Transformed data.
Not used if init != 0.
SciLib routine CFFT2,ZFFT2(3)