Calculate, by hand, the DFT of cos(2*pi(fx*m + fy*n))

  • Thread starter Thread starter Number2Pencil
  • Start date Start date
  • Tags Tags
    Dft hand
Number2Pencil
Messages
204
Reaction score
1

Homework Statement



Calculate, by hand, the DFT of cos(2*pi(fx*m + fy*n)). It should simplify to something simple. It should NOT be left as a summation.

Homework Equations



2D DFT Formula:
<br /> \tilde{s(k,l)} = \sum_{m=0}^{M-1} \sum_{n=0}^{N-1} s(m,n) e^{-j 2 \pi (\frac{1}{M}mk + \frac{1}{N}ln)}<br />

The Attempt at a Solution




<br /> \tilde{s(k,l)} = \sum_{m=0}^{M-1} \sum_{n=0}^{N-1} cos(2 \pi (f_x m + f_y n)) e^{-j 2 \pi (\frac{1}{M}mk + \frac{1}{N}ln)}<br />


One of Euler's Formulas:

<br /> cos(u+v) = \frac{1}{2}(e^{ju + jv} + e^{-ju -jv})<br />


After much algebra crunching, I wound up with this:

<br /> \tilde{s(k,l)} = \sum_{m=0}^{M-1} \sum_{n=0}^{N-1} \left[ \frac{1}{2}e^{-j2 \pi <br /> \frac<br /> {-f_x m M N + m k N + l n M - f_y n M N}<br /> {MN}<br /> } + \frac{1}{2} e^{-j2 \pi <br /> \frac<br /> {f_x m M N + f_y n M N + m k N + l n M}<br /> {MN}} \right]<br />

I am really not sure how to simplify this double geometric sum. Does it look recognizable? Was there an earlier simplification I could take?
 
Physics news on Phys.org
Consider just one of the two added terms. As a function of n, it's of the form exp(An+B) = exp(A)nexp(B). So isn't it just the sum of a geometric series?
 
So if e^{An+B} = e^{An} e^{B}, then e^{B} simply acts as a constant for the internal geometric sum?

[(1-A^M)/(1-A)] e^{B} ?

And then I can take the geometric sum again?

The original cosine function is not separable...is it?
 
Number2Pencil said:
So if e^{An+B} = e^{An} e^{B}, then e^{B} simply acts as a constant for the internal geometric sum?

[(1-A^M)/(1-A)] e^{B} ?

And then I can take the geometric sum again?
Looks ok to me.
 
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