if fft is a discrete fourier transform
2 visualizzazioni (ultimi 30 giorni)
Mostra commenti meno recenti
Julian Oviedo
il 10 Ott 2016
Commentato: Star Strider
il 10 Ott 2016
if the fft (fast fourier transform) is a discrete fourier transform, so Why the spectrum is not repetitive? https://en.wikipedia.org/wiki/Discrete_Fourier_transform
1 Commento
Massimo Zanetti
il 10 Ott 2016
No one expects the spectrum is "repetitive" (I assume that by "repetitive" you mean "periodic").
Take a very simple example. The signal you want to transform is a sinusoid, then its transform is just an impulse function.
Risposta accettata
Star Strider
il 10 Ott 2016
The fast Fourier transform operates on finite sequences with specific sampling intervals (frequencies). Unlike the analytical Fourier transform that extends from -Inf to +Inf in the frequency domain, the discrete Fourier transform extends only as far as the Nyquist frequency, the highest uniquely resolvable frequency in a sampled signal (and the frequency above which ‘aliasing’ occurs if the analog-to-digital converter does not have a hardware anti-aliasing filter on its input to prevent higher frequencies from being sampled). See signal processing textbooks by Proakis and others (or any number of books devoted to the Fourier transform and its applications) for details.
0 Commenti
Più risposte (1)
Julian Oviedo
il 10 Ott 2016
1 Commento
Star Strider
il 10 Ott 2016
The two-sided discrete Fourier transform exists only in the region of ±Nyquist frequency, not infinity. In a sampled signal, you know only what is in the signal you have. What may exist in the signal if you sampled it longer is completely unknown to you. Nothing in or derived from a sampled signal is, or ever will be, infinite.
I don’t have Introduction to Digital Signal Processing and Filter Design in my library, but by the description, it should cover this.
Vedere anche
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!