- Asked 2/30
- 2081 Chaitra · 6+6 marks
- 2079 Asoj · 4+8 marks
DTFT of sgn[n] and u[n]
Short answer
Define sgn[n] as limit of decaying sequences, giving DTFT 2/(1 - e^{-jw}) for w ≠ 2pi k. Then u[n] = 1/2 + (1/2)sgn[n] yields U(e^{jw}) = 1/(1 - e^{-jw}) + pi sum delta(w - 2pi k).
Determine the discrete time fourier transform of signum function (sgn[n]) and use it to find the DTFT of unit-step signal u[n].
The definition used here is for and for , so that . (A note at the end covers the version with .)
sgn[n]
1 * * * *
| | | |
----+--+--+--+--+--+--+--+--- n
| | | |
-1 * * * *
-4 -3 -2 -1 0 1 2 3
DTFT of sgn[n]
is not absolutely summable, so take it as a limit of decaying sequences ():
First part:
Second part, with :
Hence
Let . In the second term, divide the numerator and denominator by :
Therefore
Since has zero average value, there is no impulse at .
Magnitude and phase: , so
The phase is for (and for ).
DTFT of u[n]
The constant has DTFT . (Its inverse DTFT over one period is .) So
By linearity:
Check
- As , and . The impulses account for the DC value of .
- Accumulation property: , which gives , the same result.
- This is the DT counterpart of .
Note: if is defined with , it equals the version above minus . Its DTFT is then . Using gives the same .
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Fourier transform of unit step · Signals and Systems, chapter 3 · asked 3×
- Fourier series vs transform; DTFT of aⁿ · Signals and Systems, chapter 3
- Derive the discrete-time Fourier series · Signals and Systems, chapter 2 · asked 15×
- Fourier transform of a CT signal · Signals and Systems, chapter 3
- Unit step and delta: CT and DT · Signals and Systems, chapter 1 · asked 2×
- DT unit step; periodicity of e^(jωn) · Signals and Systems, chapter 1 · asked 5×
- Unit step in terms of signum; energy or power · Communication Systems, chapter 1
- Unit step signal and relation to impulse · Digital Signal Analysis and Processing, chapter 1
- Z-transform of k² e^(−ak) from unit step · Digital Control System, chapter 2
- Discrete and Fast Fourier Transform · Computational Techniques in Civil Engineering, chapter 2