A message from our CEO about the future of Stack Overflow and Stack Exchange. Read now.

# Questions tagged [fft]

The fast Fourier transform is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse.

2,100 questions
Filter by
Sorted by
Tagged with
320 views

### M-point FFT Amplitude of N-samples of a sinusoid

Suppose you have N samples of a sinusoid of frequency $f_0$. $$x[n] = A\sin[2\pi (f_0/f_s)n ]$$ Suppose you take an M-point FFT (where M may be greater than N) of your N samples of x. What will ...
1k views

### How does one know how many times to downsample in Harmonic Product Spectrum?

I have been working on a Harmonic Product Spectrum Algorithm. Now, all the literature I've read about the subject tells me to downsample an N amount of times. How does one determine what this N value ...
78 views

### If I want to apply a filter to an Image should I use the IIR or FIR filters?

So I have discrete pixel values in the image and each row or column would make a signal. I would like to filter some of the rows or columns to remove high frequency components from them. Should I use ...