◆ cfft1f()

One-dimensional complex Fourier transform

Purpose: cfft1f computes the one-dimensional Fourier transform of a periodic sequence within a complex array. This is referred to as the forward transform or Fourier analysis, transforming the sequence from physical to spectral space.
c[k] = (1/n)Σc[j]exp(-2πijk/n) (Σ for j = 0 to n-1) (k = 0 to n-1) (i is imaginary unit)

This transform is normalized since a call to cfft1f followed by a call to cfft1b (or vice-versa) reproduces the original array subject to algorithmic constraints, roundoff error, etc.

Parameters

[in]	n	The length of the sequence to be transformed. (n >= 1) The transform is most efficient when n is a product of small primes.
[in]	inc	Integer increment between the locations, in array c[], of two consecutive elements within the sequence. (inc >= 1)
[in,out]	c[]	Array c[lc] [in] The sequence to be transformed. [out] The Fourier forward transformed sequence of data.
[in]	lc	The length of the array c[]. (lc >= inc*(n - 1) + 1)
[in]	wsave[]	Array wsave[lwsave] Work data. Its contents must be initialized with a call to cfft1i before the first call to cfft1f or cfft1b for a given transform length n.
[in]	lwsave	The length of the array wsave[]. (lwsave >= 2*n + ln(n)/ln(2) + 4)
[out]	work[]	Array work[lwork] Work array.
[in]	lwork	The length of the array work[]. (lwork >= 2*n)
[out]	info	= 0: Successful exit = -1: The argument n had an illegal value (n < 1) = -2: The argument inc had an illegal value (inc < 1) = -4: The argument lc had an illegal value (lc not big enough) = -6: The argument lwsave had an illegal value (lwsave not big enough) = -8: The argument lwork had an illegal value (lwork not big enough)