Skip to main content

DTFT of (1/2)^(n−1)u[n−1]

Short answer

x[n] = (1/2)^{n−1} u[n−1] is a delayed version of (1/2)^n u[n]. The DTFT of (1/2)^n u[n] is 1/(1−½ e^{−jω}); time-shift gives X(e^{jω}) = e^{−jω}/(1−½ e^{−jω}).

Compute discrete time Fourier transform of the discrete time signal x[n] = (1/2)^(n−1) u[n−1]

The signal x[n]=(12)n−1u[n−1]x[n] = \left(\tfrac{1}{2}\right)^{n-1}u[n-1] is the sequence g[n]=(12)nu[n]g[n] = \left(\tfrac{1}{2}\right)^n u[n] delayed by one sample: x[n]=g[n−1]x[n] = g[n-1].

Method 1: time-shift property

g[n]=(12)nu[n]↔G(ejω)=∑n=0∞(12e−jω)n=11−12e−jωg[n] = \left(\tfrac{1}{2}\right)^n u[n] \leftrightarrow G(e^{j\omega}) = \sum_{n=0}^{\infty}\left(\tfrac{1}{2}e^{-j\omega}\right)^n = \frac{1}{1 - \frac{1}{2}e^{-j\omega}}

The geometric series converges because ∣12e−jω∣=12<1|\tfrac{1}{2}e^{-j\omega}| = \tfrac{1}{2} < 1. Then, by g[n−n0]↔e−jωn0G(ejω)g[n - n_0] \leftrightarrow e^{-j\omega n_0}G(e^{j\omega}) with n0=1n_0 = 1:

X(ejω)=e−jω1−12e−jω\boxed{X(e^{j\omega}) = \frac{e^{-j\omega}}{1 - \frac{1}{2}e^{-j\omega}}}

Method 2: direct sum (check)

X(ejω)=∑n=1∞(12)n−1e−jωn=e−jω∑m=0∞(12e−jω)m=e−jω1−12e−jωX(e^{j\omega}) = \sum_{n=1}^{\infty}\left(\tfrac{1}{2}\right)^{n-1}e^{-j\omega n} = e^{-j\omega}\sum_{m=0}^{\infty}\left(\tfrac{1}{2}e^{-j\omega}\right)^m = \frac{e^{-j\omega}}{1 - \frac{1}{2}e^{-j\omega}}

Here m=n−1m = n - 1.

Magnitude: ∣X(ejω)∣=11.25−cos⁡ω|X(e^{j\omega})| = \frac{1}{\sqrt{1.25 - \cos\omega}}. This is 2 at ω=0\omega = 0 and 2/32/3 at ω=π\omega = \pi, the same as for g[n]g[n]. The delay only adds a phase of −ω-\omega.

✓ Answer checked by Claude Opus 5.5 (high effort)

All Signals and Systems chapter 3 questions →