Consider the finite sequence . The Inverse Discrete Fourier Transform (IDFT) of is given as . The value of is ____
GATE 2020 IN Q.48: solution and answer
Answer and solution
ANSWER
. The IDFT of is .
Official answer: 0Source: Official answer key, GATE 2020 IN (IIT Delhi)
Here and . Use the IDFT definition:
Put and . The exponents are for :
Because , the bracket is . This is the sum of the three cube roots of unity, which is .
Check it directly: so .
Shortcut: the -point DFT of is for every . The DFT is one-to-one, so the IDFT of the flat spectrum must be . That gives and .
KEY IDEA
A flat -point spectrum is the DFT of the unit impulse , so its IDFT is . Worked out term by term, is times the sum of the three cube roots of unity, and that sum is zero.
WATCH OUT FOR
Leaving out the factor or using the forward-DFT sign . For this spectrum neither changes , but both give the wrong (3 instead of 1 without the factor). Another mistake is to assume that a constant spectrum gives a constant sequence , or . A constant sequence has a spectrum that is an impulse. A constant spectrum belongs to an impulse sequence.
From the GATE 2020 IN paper. Every question of this paper · Download the full paper · All 11 DTFT & DFT questions, with notes
More DTFT & DFT questions
- GATE 2018 IN Q.35 · MCQ · 2 marksFor the sequence x[n] = 1, -1, 1, -1, with n = 0,1,2,3, the DFT is computed as X(k) = Σ_n=0^3 x[n]e^-j(2…
- GATE 2025 IN Q.54 · NAT · 2 marksLet X(e^j ω) represent the discrete time Fourier transform of a 4-length sequence x[n], where x[0]=1…
- GATE 2024 EC Q.59 · NAT · 2 marksThe relationship between any N-length sequence x[n] and its corresponding N-point discrete Fourier transform…
- GATE 2024 IN Q.25 · NAT · 1 markThe number of complex multiplications required for computing a 16-point DFT using the decimation-in-time…
