(New page: SYSTEM 1 - <math>h[n] = \delta[n+1] + \delta[n-1]</math> A - For an LTI system to be memoryless, the output value of 'n' should only depend on the input value of 'n'. But, in this case,...) |
|||
| Line 13: | Line 13: | ||
Therefore, h[n] = Bounded + Bounded = Stable | Therefore, h[n] = Bounded + Bounded = Stable | ||
| + | |||
| + | |||
| + | SYSTEM 2 - | ||
| + | <math>h[n] = e^t[\delta[n+1] + \delta[n-1]]</math> | ||
Revision as of 13:07, 30 June 2008
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 input value of 'n'. But, in this case, the output value of 'n' depends on the past and future values of 'n'. As a result, the system is NOT memoryless or in other words, has memory.
B - For an LTI system to be causal, the output should NOT depend on the future input values. But, in this case, the output does depend on the future input values and as a result, is not causal.
C - Stable
$ \delta[n+1] $ - Bounded (Stable)
$ \delta[n-1] $ - Bounded (Stable)
Therefore, h[n] = Bounded + Bounded = Stable
SYSTEM 2 -
$ h[n] = e^t[\delta[n+1] + \delta[n-1]] $
