Lomont3FFT, which re-derives the algorithm indices to avoid all the multiplies by two. This and the next version were the best performing. More...
Inheritance diagram for Lomont3FFT:
Public Member Functions | |
| override void | FFT (double[] data, bool forward) |
| Compute the forward or inverse FFT of data, which is complex valued items, stored in alternating real and imaginary real numbers. The length must be a power of 2. More... | |
 Public Member Functions inherited from LomontFFTBase | |
| virtual void | Initialize (int size) |
| For static initialization for a given size, call this More... | |
| virtual void | RealFFT (double[] data, bool forward) |
| Perform a FFT on real data, returning half the (symmetric) complex transform as (real,imaginary) interleaved pairs More... | |
Detailed Description
Lomont3FFT, which re-derives the algorithm indices to avoid all the multiplies by two. This and the next version were the best performing.
Member Function Documentation
◆ FFT()
|
inlinevirtual |
Compute the forward or inverse FFT of data, which is complex valued items, stored in alternating real and imaginary real numbers. The length must be a power of 2.
- Parameters
-
data forward
Implements LomontFFTBase.
The documentation for this class was generated from the following file:
- AnnotationPro.Statistics/Lomont3FFT.cs
