**How many points are in FFT? **

**N Points**

Fast Fourier Transform (FFT) is an algorithm used to compute the discrete Fourier transform and its inverse. FFT points are denoted by the letter N in the formula 2N^2 to 2NlgN, where lg is the base-2 logarithm. Discrete Fourier transforms can be quickly calculated for N that is equal to 2, 3, 4, 5, 7, 8, 11, 13, and 16 using the Winograd transform algorithm.

## Leave a Reply