Filter löschen
Filter löschen

Number of cycles before and after FFT

5 Ansichten (letzte 30 Tage)
Brad
Brad am 11 Apr. 2020
Kommentiert: Star Strider am 18 Apr. 2020
Hi.
I have the signal y1 (fig1), take its fft, do some processing on it and take ifft to take it back to time domain. What I get is fig 2. I have two questions though:
1. Why the resultant signal is less dense than the original one (with less number of cycles)? Shouldn't they be similar?
2. Why the early indices of the resultant vector (y2), at t~ 0, have much large values? This happens sometimes in my analysis.
Thank you
Brad
  2 Kommentare
dpb
dpb am 11 Apr. 2020
"do some processing on it and take ifft to take it back to time domain."
Well, then the result could be anything -- it all depends on what "some processing" is.
What processing you did resulted in, well, the results you got. Some other processing would produce other results.
Brad
Brad am 11 Apr. 2020
Thank you for your response.
It involved a few simple multiplications and divisions. Do these two signal don't necessary have to be similar?

Melden Sie sich an, um zu kommentieren.

Akzeptierte Antwort

Star Strider
Star Strider am 12 Apr. 2020
Brad — You requested that I answer this so I’ll do my best.
It appears to me that ‘some processing’ is essentially some sort of lowpass filter. There are fewer cycles because the higher frequencies have been filtered out. My guess is that this is the single explanation for both of your observations.
The superposition of the higher and lower frequencies (and the absence of the higher frequencies after filtering) may account for the amplitude variations.
.
  21 Kommentare
Brad
Brad am 18 Apr. 2020
1. What is the physical or mathematical reason for fftshift?
2. Is it always necessary to use fftshift? if not, when do we have to use it?
Thanks
Star Strider
Star Strider am 18 Apr. 2020
As always, my pleasure!
1. The Fourier transform is symmetrical by definition, going from to , and fftshift allows for that symmetry convention.
2. It is never necessary to use it. In some instances it is convenient to use it, for example to identify symmetry in the Fourier transform of a square wave:
syms f(t) t w
f(t) = 1;
F(w) = int(f*exp(-1i*w*t), t, -1, 1)
figure
fplot(F, [-10*pi 10*pi])
grid
.

Melden Sie sich an, um zu kommentieren.

Weitere Antworten (0)

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by