|
|
◆ WCfft1f2()
| Function WCfft1f2 |
( |
N As |
Long, |
|
|
C As |
Variant |
|
) |
| |
One-dimensional complex Fourier transform (complex numbers in pairs of cells)
- Purpose
- WCfft1f 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 WCfft1f followed by a call to WCfft1b (or vice-versa) reproduces the original array subject to algorithmic constraints, roundoff error, etc.
To represent complex numbers, a real part and an imaginary part are stored in a pair of adjacent cells (a real part in a left cell, and an imaginary part in a right cell). The computed results are stored in the same way.
- Returns
- N x 2
| Column 1 | Column 2 |
| Rows 1 to N | Fourier transformed data sequence (real part) | Fourier transformed data sequence (imaginary part) |
- 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] | C | (N x 2 columns) The complex sequence to be transformed. |
- Reference
- FFTPACK
- Example
- Compute the Fourier transform of the data sequence by WCfft1f. Then compute its backward transform by WCfft1b and confirm that the original data sequence is restored.
|