Revision as of 15:42, 2 July 2008 by Agshah (Talk)

SYSTEM 1 - $ h[n] = \delta[n+1] + \delta[n-1] $

A - For an LTI system to be memoryless, the output value of 'n' should only depend on the CURRENT input value of 'n'. That is, $ y[n] = Kx[n] $. But, in this case, the output value of 'n' depends on the past and future values of 'n'. In other words, $ y[n] \neq Kx[n] $. As a result, the system is NOT memoryless or has memory.

B - For an LTI system to be causal, the output should NOT depend on the future input values. In other words, $ h[k] = 0 for k < 0 $. But, in this case, the output does depend on the future input values and as a result, is not causal. That is, $ h[k] \neq 0 for k < 0 $. One can easily check the causality of an LTI system by looking at the negative x-axis.

C - Stable (Why?)

$ \delta[n+1] $ - Bounded (Stable)

$ \delta[n-1] $ - Bounded (Stable)

Therefore, h[n] = Bounded + Bounded = Bounded (Stable)


SYSTEM 2 - $ h(t) = e^t[u(t-2) - u(t-5)] $

A - For an LTI system to be memoryless, the output value of 't' should only depend on the CURRENT input value of 't'. That is, $ y(t) = Kx(t) $. But, in this case, the output value of 't' depends on the past value of 't'. In other words, $ y(t) \neq Kx(t) $. As a result, the system is NOT memoryless or has memory.

B - For an LTI system to be causal, the output should NOT depend on the future input values. In this case, the output only depends on the past input values and as a result, is causal. Therefore, $ h(t) = 0 for k < 0 $. One can easily check the causality of an LTI system by looking at the negative x-axis.

C - Let $ x(t) = u(t-2) - u(t-5) $

Then, $ h(t) = e^t[x(t)] $

Now, if x(t) is bounded (Why? - refer SYSTEM 1), then h(t) is bounded too.

Hence, h(t) is stable.

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood