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
Click For Summary

Homework Help Overview

The problem involves calculating the Discrete Fourier Transform (DFT) of the function cos(2*pi(fx*m + fy*n)). The original poster seeks a simplified expression rather than a summation.

Discussion Character

  • Mathematical reasoning, Problem interpretation

Approaches and Questions Raised

  • Participants discuss the application of Euler's formula to express the cosine function in terms of exponential functions. There is an exploration of simplifying the resulting double summation and identifying recognizable forms. Questions arise regarding the treatment of terms in the summation, particularly in relation to geometric series.

Discussion Status

Participants are actively engaging with the problem, examining the structure of the summation and considering the implications of treating certain terms as constants. There is a focus on the potential for simplification through geometric series, although no consensus on the next steps has been reached.

Contextual Notes

There is an indication that the original cosine function may not be separable, which could affect the approach to simplification. The discussion reflects a mix of algebraic manipulation and conceptual questioning regarding the DFT process.

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.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 17 ·
Replies
17
Views
3K
Replies
1
Views
1K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K