Compute the Fourier Transform for: x(n)=u(n)-u(n-6); x(n)=[(2^n)*u]*(-n); x(n)=[-2,-1,0,1,2]

19 Ansichten (letzte 30 Tage)
For the first equation:
x=[1 0 0 0 0 0 -1];
y=fft(x)
y =
Columns 1 through 3
0.0000 + 0.0000i 0.3765 - 0.7818i 1.2225 - 0.9749i
Columns 4 through 6
1.9010 - 0.4339i 1.9010 + 0.4339i 1.2225 + 0.9749i
Column 7
0.3765 + 0.7818i
But thats all I can solve, the other 2 equations need help....Thanks!

Antworten (1)

Sharmin Kibria
Sharmin Kibria am 25 Jun. 2021
Hello,
I believe you are trying to calculate the Fourier Transform of the three signals.
x[n] = u[n]-u[n-6] = 1, n = 0,1,...5, x[n] = 0 otherwise
x[n] = (2^n)u[-n]
x[n] = [-2 -1 0 1 2]
You should be able to calculate the FFT for the third signal directly. For the first two signals you need to theorically calculate the values of x[n] from the definition of unit step function. Once you know the values of x[n], you can calculate the FFT for these signals.
Thanks
Sharmin

Kategorien

Mehr zu Fourier Analysis and Filtering finden Sie in Help Center und File Exchange

Tags

Produkte


Version

R2020b

Community Treasure Hunt

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

Start Hunting!

Translated by