- Asked 3/30
- 2082 Kartik · 6 marks
- 2079 Chaitra · 8 marks
- 2083 Baisakh (new course) · 5 marks
Derive the DTFT pair
Short answer
Create a periodic extension of the aperiodic x[n] with period N, expand in DTFS, then define envelope X(e^{jω})=Σ x[n]e^{-jωn}. As N→∞, the FS sum becomes an integral over 2π, yielding the DTFT pair: analysis X(e^{jω})=Σ x[n]e^{-jωn} and synthesis x[n]=(1/2π)∫_{2π} X(e^{jω})e^{jωn}dω.
Derive Fourier transform pair equations of a discrete-time (aperiodic) signal.
The DTFT pair is derived by treating an aperiodic sequence as the limit of a periodic sequence whose period , and then using the discrete-time Fourier series.
Step 1: Build a periodic extension
Let be of finite duration, non-zero only for . Form by repeating with period , where is large enough that the copies do not overlap. Over one period , and as .
x[n]: ..0 0 [###] 0 0..
x~[n]: [###] . . . [###] . . . [###]
|<--- N --->|
Step 2: DTFS of the periodic extension
With :
Choose the period so that it contains . There , and outside, so the sum can run over all :
Step 3: Define the envelope
Define
Then . The DTFS coefficients are samples of this continuous envelope, spaced apart.
Step 4: Substitute back
Using :
Step 5: Take the limit N → ∞
- , and (a continuous variable).
- The sum over consecutive covers a frequency range of , so it becomes an integral over an interval of length .
- .
The result is the DTFT pair:
Remarks
- is continuous in and periodic with period , since . That is why the synthesis integral covers only .
- Convergence: the analysis sum converges if (absolutely summable) or (finite energy, convergence in mean square).
- Example: with gives .
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Derive the discrete-time Fourier series · Signals and Systems, chapter 2 · asked 15×
- Derive the CT Fourier transform pair · Signals and Systems, chapter 3 · asked 3×
- Derive DTFT; DTFT periodic with 2π · Signals and Systems, chapter 3 · asked 3×
- Fourier series vs transform; DTFT of aⁿ · Signals and Systems, chapter 3
- Fourier transform of a CT signal · Signals and Systems, chapter 3
- Derive exponential Fourier series (CT) · Signals and Systems, chapter 2 · asked 15×
- Autocorrelation and ESD as Fourier transform pair · Communication Systems, chapter 1
- Discrete and Fast Fourier Transform · Computational Techniques in Civil Engineering, chapter 2
- Fourier transform of a DC signal · Data Communication, chapter 3
- Derive time shifting property of z-transform · Digital Signal Analysis and Processing, chapter 2