DISCRETE FOURIER TRANSFORM AND FAST FOURIER ALGORITHM*

摘要

In recent years the fast Fourier transform algorithm for computing discrete Fourier transforms has come into prominence. This development is basically due to the fact that the computer time is reduced from N 2 to (N/2) log2 N where N is the number of disc