| Line 2: | Line 2: | ||
A system is memoryless if for any <math>t\in \mathbb{R}</math> only on the input at <math>t_0,</math> | A system is memoryless if for any <math>t\in \mathbb{R}</math> only on the input at <math>t_0,</math> | ||
| − | Eg: | + | |
| + | Eg: | ||
| + | |||
<pre> Y(t) = X(t) + X(t-1){ memoryless} | <pre> Y(t) = X(t) + X(t-1){ memoryless} | ||
Y(t) = X(t)+X(t-1) { with memory}.</pre> | Y(t) = X(t)+X(t-1) { with memory}.</pre> | ||
| Line 12: | Line 14: | ||
Eg: | Eg: | ||
| − | <pre> Y(t) = 2x(t) + 3 | + | <pre> Y(t) = 2x(t) + 3.</pre> |
Revision as of 08:48, 18 September 2008
Memory less system
A system is memoryless if for any $ t\in \mathbb{R} $ only on the input at $ t_0, $
Eg:
Y(t) = X(t) + X(t-1){ memoryless}
Y(t) = X(t)+X(t-1) { with memory}.
Invertible systems
A system is invertible if distinct inputs yield distinct outputs.
Eg:
Y(t) = 2x(t) + 3.
