common/alcomplex.h

   1 #ifndef ALCOMPLEX_H
   2 #define ALCOMPLEX_H
   3
   4 #include <complex>
   5
   6 /**
   7  * Iterative implementation of 2-radix FFT (In-place algorithm). Sign = -1 is
   8  * FFT and 1 is iFFT (inverse). Fills FFTBuffer[0...FFTSize-1] with the
   9  * Discrete Fourier Transform (DFT) of the time domain data stored in
  10  * FFTBuffer[0...FFTSize-1]. FFTBuffer is an array of complex numbers, FFTSize
  11  * MUST BE power of two.
  12  */
  13 void complex_fft(std::complex<double> *FFTBuffer, int FFTSize, double Sign);
  14
  15 /**
  16  * Calculate the complex helical sequence (discrete-time analytical signal) of
  17  * the given input using the discrete Hilbert transform (In-place algorithm).
  18  * Fills Buffer[0...size-1] with the discrete-time analytical signal stored in
  19  * Buffer[0...size-1]. Buffer is an array of complex numbers, size MUST BE
  20  * power of two.
  21  */
  22 void complex_hilbert(std::complex<double> *Buffer, int size);
  23
  24 #endif /* ALCOMPLEX_H */