Skip to main content

Properties of DT LTI systems

Short answer

A DT LTI system is defined by h[n] and convolution. Properties: commutative, associative (cascade), distributive (parallel); memoryless iff h[n]=Kδ[n]; causal iff h[n]=0 for n<0; BIBO stable iff sum |h[n]| < ∞; invertible iff h*h_i=δ.

State and explain (describe) different properties of a discrete-time LTI system with suitable examples.

A discrete-time LTI system is linear and time invariant. It is completely described by its impulse response h[n]h[n], and its output is the convolution sum y[n]=∑kx[k] h[n−k]=x[n]∗h[n]y[n] = \sum_k x[k]\,h[n-k] = x[n]*h[n]. Its main properties are listed below, with the test in terms of h[n]h[n].

1. Commutative property

x[n]∗h[n]=h[n]∗x[n]x[n]*h[n] = h[n]*x[n]: input and impulse response can be interchanged. Example: {1,1}∗{1,2}={1,2}∗{1,1}={1,3,2}\{1,1\}*\{1,2\} = \{1,2\}*\{1,1\} = \{1,3,2\}.

2. Associative property (cascade)

(x∗h1)∗h2=x∗(h1∗h2)\left(x*h_1\right)*h_2 = x*\left(h_1*h_2\right). Two systems in cascade equal one system with h[n]=h1[n]∗h2[n]h[n] = h_1[n]*h_2[n], and the order of the cascade does not matter.

x -->[h1]-->[h2]--> y  ==  x -->[h1*h2]--> y

3. Distributive property (parallel)

x∗(h1+h2)=x∗h1+x∗h2x*(h_1 + h_2) = x*h_1 + x*h_2. Two systems in parallel equal one system with h[n]=h1[n]+h2[n]h[n] = h_1[n] + h_2[n].

4. Memory

The system is memoryless only if h[n]=Kδ[n]h[n] = K\delta[n], i.e. y[n]=Kx[n]y[n] = Kx[n]. Otherwise it has memory. Example: h[n]=δ[n]+δ[n−1]h[n] = \delta[n] + \delta[n-1] (y[n]=x[n]+x[n−1]y[n] = x[n] + x[n-1]) has memory.

5. Causality

Causal if h[n]=0h[n] = 0 for n<0n < 0, so the output uses no future inputs. Example: h[n]=(0.5)nu[n]h[n] = (0.5)^n u[n] is causal; h[n]=δ[n+1]h[n] = \delta[n+1] (y[n]=x[n+1]y[n] = x[n+1]) is not.

6. Stability (BIBO)

Stable if the impulse response is absolutely summable:

∑n=−∞∞∣h[n]∣<∞\sum_{n=-\infty}^{\infty} |h[n]| < \infty

Example: h[n]=(0.5)nu[n]h[n] = (0.5)^n u[n] gives ∑=2\sum = 2, stable; h[n]=u[n]h[n] = u[n] (accumulator) gives an infinite sum, unstable. Every FIR system is stable.

7. Invertibility

Invertible if an inverse system hi[n]h_i[n] exists with h[n]∗hi[n]=δ[n]h[n]*h_i[n] = \delta[n]. Example: the accumulator h[n]=u[n]h[n] = u[n] has inverse hi[n]=δ[n]−δ[n−1]h_i[n] = \delta[n] - \delta[n-1] (first difference).

8. Identity and unit step response

x[n]∗δ[n]=x[n]x[n]*\delta[n] = x[n] and x[n]∗δ[n−k]=x[n−k]x[n]*\delta[n-k] = x[n-k]. The step response is the running sum of h[n]h[n]: s[n]=∑k=−∞nh[k]s[n] = \sum_{k=-\infty}^{n} h[k].

PropertyCondition on h[n]h[n]
Memorylessh[n]=Kδ[n]h[n] = K\delta[n]
Causalh[n]=0h[n] = 0, n<0n < 0
Stable∑∣h[n]∣<∞\sum \lvert h[n]\rvert < \infty
Invertibleh∗hi=δ[n]h * h_i = \delta[n]
Cascadeh1∗h2h_1 * h_2
Parallelh1+h2h_1 + h_2

✓ Answer checked by Claude Opus 5.5 (high effort)

All Signals and Systems chapter 6 questions →