Line 4: | Line 4: | ||
h[n] = h(t) = 0 , For all n < 0 & t < 0 | h[n] = h(t) = 0 , For all n < 0 & t < 0 | ||
+ | |||
+ | *Also, if output depends only on past '''OR''' present but '''NOT''' future values of "t" or "n". | ||
Line 10: | Line 12: | ||
<math>\sum_{k=-\infty}^\infty |h[n]| < \infty </math> , <math>\int_{-\infty}^{\infty}|h(t)| < \infty.</math> | <math>\sum_{k=-\infty}^\infty |h[n]| < \infty </math> , <math>\int_{-\infty}^{\infty}|h(t)| < \infty.</math> | ||
+ | |||
+ | |||
+ | == '''Memoryless''' == | ||
+ | |||
+ | *If output depends only on present values of "t" or "n". |
Latest revision as of 09:06, 22 July 2009
Causal
h[n] = h(t) = 0 , For all n < 0 & t < 0
- Also, if output depends only on past OR present but NOT future values of "t" or "n".
Stable
$ \sum_{k=-\infty}^\infty |h[n]| < \infty $ , $ \int_{-\infty}^{\infty}|h(t)| < \infty. $
Memoryless
- If output depends only on present values of "t" or "n".