m (→Invertibility) |
|||
| Line 5: | Line 5: | ||
A system with memory has outputs that depend on previous (or future) inputs. | A system with memory has outputs that depend on previous (or future) inputs. | ||
| − | Example of a system '''with''' memory: | + | *Example of a system '''with''' memory: |
<math>y(t) = x(t - \pi)</math> | <math>y(t) = x(t - \pi)</math> | ||
| − | Example of a system '''without''' memory: | + | *Example of a system '''without''' memory: |
<math>y(t) = x(t)</math> | <math>y(t) = x(t)</math> | ||
Revision as of 22:51, 17 June 2008
Contents
The six basic properties of Systems_Old Kiwi
Memory_Old Kiwi
A system with memory has outputs that depend on previous (or future) inputs.
- Example of a system with memory:
$ y(t) = x(t - \pi) $
- Example of a system without memory:
$ y(t) = x(t) $
Invertibility_Old Kiwi
An invertible system is one in which there is a one-to-one correlation between inputs and outputs.
- Example of an invertible system:
$ y(t) = x(t) $
- Example of a non-invertible system:
$ y(t) = |x(t)| $
In the second example, both x(t) = -3 and x(t) = 3 yield the same result.
