Fundamentals and literature review of Fourier transform in power quality issues

1. Fast Fourier Transform

1.1. It is an efficient algorithm to compute the discrete Fourier transform and its inverse

1.1.1. There are two algorithms

1.1.1.1. Decimation in time

1.1.1.2. Decimation in frequency

2. Inverse fast Fourier transform

2.1. It is calculated by using the equations based on FFT with simple operations

3. Literature review

3.1. Methods dependent on DFT and FFT

3.2. Methods dependent on wavelet transform and FFT

3.3. Methods dependent on neural networks

3.4. Methods dependent on fuzzy logic

3.5. Methods dependent on other methods

4. Fourier series

4.1. It is named after Jean Baptiste Joseph Fourier

4.1.1. The Fourier series is described in theory and problems of advanced calculus

5. Fourier Transform

5.1. It is used to transform signals between

5.1.1. The domain of time

5.1.2. The frecuence domain

6. Discrete Fourier Transform

6.1. It is used for a finite-length signal, which is discretized in frequency.