ECG, FFT and IFFT

Projects Programming
9

The FFT is just a fast and accurate algorithm to perform the Discrete Fourier Transform (DFT) .

The inverse of a DFT can be obtained by

  1. Create the complex conjugate of the DFT coeficients,
  2. Perform the DFT of the result of (1),
  3. Create the complex conjugate of the result of (2),
  4. Scale the result of (3) by the number of points.