MHB Compute Discrete Time Fourier Transform

nacho-man
Messages
166
Reaction score
0
Hi bros,

so I feel like I am very close, but cannot find out how to go further.

Q.1 Compute the DTFT of the following signals, either directly or using its properties (below a is a fixed constant |a| < 1):

for $x_n = a^n \cos(\lambda_0 n)u_n$ where $\lambda_0 \in (0, \pi)$ and
$u_n$ is the step function, i.e $u_n = 1 $ for $n\ge 0 $ and $0$ otherwise.so,

$X(e^{i \lambda}) = \sum_{n=0}^{+\infty} x_n e^{-i\lambda n}$$X(e^{i \lambda}) = \sum_{n=0}^{+\infty} a^n \cos(\lambda_0 n) e^{-i\lambda n}$

using euler's formula: $\cos(\lambda_0 n)$ = $\frac{e^{i\lambda_0 n}+ e^{-i\lambda_0 n}}{2} $

so $X(e^{i \lambda}) = \frac{1}{2} \sum_{n=0}^{+\infty} (a e^{-i \lambda}( e^{i\lambda_0}+ e^{-i\lambda_0}))^n $

which gives

$\frac{1}{2} \sum_{n=0}^{+\infty} a^n(e^{i \lambda_0 - i\lambda} + e^{-i \lambda_0 - i\lambda})^n)$

and now i am stuck
.
i think i have it right upto this point, but i do not know how to proceed.

also in our notes, he has said to use the property called modulation, which meanswhere we have $x^n e^{i \lambda_0 n}$ the DTFT will be of the form $X(e^{i(\lambda-\lambda_0)})$ANY HELP IS APPRECIATED! thank you!
 
Mathematics news on Phys.org
Hi nacho! :)

nacho said:
$X(e^{i \lambda}) = \sum_{n=0}^{+\infty} a^n \cos(\lambda_0 n) e^{-i\lambda n}$

using euler's formula: $\cos(\lambda_0 n)$ = $\frac{e^{i\lambda_0 n}+ e^{-i\lambda_0 n}}{2} $

so $X(e^{i \lambda}) = \frac{1}{2} \sum_{n=0}^{+\infty} (a e^{-i \lambda}( e^{i\lambda_0}+ e^{-i\lambda_0}))^n $

Not so fast.
Let's first do only the substitution.

$$X(e^{i \lambda}) = \sum_{n=0}^{+\infty} a^n \cdot \frac{1}{2} (e^{i\lambda_0 n}+ e^{-i\lambda_0 n}) \cdot e^{-i \lambda n} $$

This is different from what you have. :eek:
which gives

$\frac{1}{2} \sum_{n=0}^{+\infty} a^n(e^{i \lambda_0 - i\lambda} + e^{-i \lambda_0 - i\lambda})^n)$

and now i am stuck
.
i think i have it right upto this point, but i do not know how to proceed.

Let's redo that and simplify to:
$$X(e^{i \lambda})
= \frac{1}{2} \sum_{n=0}^{+\infty} a^n (e^{-i(\lambda - \lambda_0) n}+ e^{-i(\lambda + \lambda_0) n})
= \frac{1}{2} \sum_{n=0}^{+\infty} a^n e^{-i(\lambda - \lambda_0) n} + \frac{1}{2} \sum_{n=0}^{+\infty} a^n e^{-i(\lambda + \lambda_0) n}
$$
also in our notes, he has said to use the property called modulation, which meanswhere we have $x^n e^{i \lambda_0 n}$ the DTFT will be of the form $X(e^{i(\lambda-\lambda_0)})$

Can you apply this now? (Wondering)
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Thread 'Imaginary pythagorus'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...

Similar threads

Replies
1
Views
1K
Replies
3
Views
1K
Replies
10
Views
2K
Replies
14
Views
2K
Replies
6
Views
2K
Replies
2
Views
2K
Replies
1
Views
561
Back
Top