Algorithm/Etc

Fast Fourier Transform(FFT) - 고속 푸리에 변환

# About Fast Fourier Transform is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). Fourier analysis converts a signal from its original domain (often time or space) to a representation in the frequency domain and vice versa. The DFT is obtained by decomposing a sequence of values into components of different frequencies. (reference) # Concept ..