DTFT question regarding a pair

  • Thread starter Thread starter Pavoo
  • Start date Start date
  • Tags Tags
    Dtft Pair
Pavoo
Messages
15
Reaction score
0

Homework Statement



My book writes the following: using pair for the Discrete Time Fourier Transform:
-a^{k}u[-k-1] <---(DTFT)---> \frac{1}{1-ae^{-iw}} for \left | a \right | > 1

Homework Equations



Well, for the simple similar pair such as:

a^{k}u[k] <---(DTFT)---> \frac{1}{1-ae^{-iw}} for \left | a \right | < 1

The calculation is pretty straightforward regarding the GP series.
In the above however, I get lost where they get the result from.

The Attempt at a Solution



I've come to here, coming from DTFT definition and simplifying the unitstep boundaries to the sum of:
\sum_{1}^{\infty}a^{-k}e^{iwk}

The question is, how do I get from here to the above?

a^{k}u[k] <---(DTFT)---> \frac{1}{1-ae^{-iw}} for \left | a \right | < 1

I am thankful for any walk through you can give, since I spent way too much time on this problem. Is there something obvious I don't see about this one, or is the calculation of GP series I am mistaken about?

Thanks in advance!
 
Physics news on Phys.org
Solved

Finally I understood where I've done wrong. For anyone's interest, here it is:

\sum_{1}^{\infty}a^{-k}e^{iw}=-\frac{a^{-1}e^{iw}}{1-a^{-1}e^{iw}}

From here one can solve the thing easily, which gives the correct condition that a>1 as well.

The thread may be locked now.
 
That is wrong unless you have written the sum on the left incorrectly.

That is, of course, using the formula for the sum of a geometric series:
a\sum_{n=0}^\infty r^n= \frac{a}{1- r}

\sum_{k=1}^\infty a^{-k}e^{ik\omega}= a^{-1}e^{ik\omega}\sum_{k=0}^\infty (a^{-1}e^{k\omega})^k= \frac{a^{-1}e^{i\omega}}{1- a^{-1}e^{i\omega}}

But without the "k" in the exponential, it would be just
\sum_{k= 1}^\infty a^{-k}e^{i\omega}= a^{-1}e^{i\omega}\sum_{k=0}^\infty a^{-k}= \frac{a^{-1} e^{i\omega}}{1- a^{-1}}
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top