Line 5: | Line 5: | ||
<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} | Y(t) = X(t)+X(t-1) { with memory} | ||
+ | |||
+ | |||
+ | '''Invertible systems''' | ||
+ | |||
+ | A system is invertible if distinct inputs yield distinct outputs. | ||
+ | |||
+ | Eg: | ||
+ | <pre> Y(t) = 2x(t) + 3 |
Revision as of 08:46, 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: <pre> Y(t) = 2x(t) + 3