How Can You Compute the Inverse DFT Using a DFT Algorithm?

  • Thread starter Thread starter seamie456
  • Start date Start date
  • Tags Tags
    Dft Inverse
Click For Summary
To compute the inverse Discrete Fourier Transform (IDFT) using a Discrete Fourier Transform (DFT) algorithm, the input sequence must be modified appropriately. The DFT is defined as X_k = ∑ x_n e^{-i 2 π k n / N}, while the IDFT is x_n = (1/N) ∑ X_k e^{+i 2 π k n / N}. The proposed method involves using the conjugate of the DFT, where x_n can be derived from X_k by applying the DFT to the conjugate of X_k and then taking the conjugate of the result. This approach effectively allows the calculation of the IDFT through the DFT algorithm. The discussion clarifies the mathematical relationship between the DFT and IDFT processes.
seamie456
Messages
1
Reaction score
0
How does one edit the input sequence and the results so as to be able to calculate the inverse dft with the dft algorthm?
 
Mathematics news on Phys.org
if you define the DFT by:
<br /> X_k = \sum_{n=0}^{N-1} x_n e^{-i 2 \pi \frac{k}{N} n} = DFT\left(x\right)_k<br />
and it inverse DFT by
<br /> x_n = \frac{1}{N} \sum_{k=0}^{N-1} X_k e^{+i 2 \pi \frac{k}{N} n} = IDFT\left(X\right)_n,<br />
then the way to get x_n from X_k using a DFT would be something like,
<br /> x_n = \frac{1}{N} \left(\sum_{k=0}^{N-1} X_k^* e^{-i 2 \pi \frac{k}{N} n}\right)^* = \frac{1}{N} \left( DFT \left( X^* \right) \right)_n^*<br />.
where the asterix represents conjugation. Does that make sense?

jason
 
Here is a little puzzle from the book 100 Geometric Games by Pierre Berloquin. The side of a small square is one meter long and the side of a larger square one and a half meters long. One vertex of the large square is at the center of the small square. The side of the large square cuts two sides of the small square into one- third parts and two-thirds parts. What is the area where the squares overlap?

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
Replies
0
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
5K
  • · Replies 13 ·
Replies
13
Views
3K