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)
+
<pre> Y(t) = X(t) + X(t-1){ memoryless}
 +
<pre> Y(t) = X(t)+X(t-1)  { with memory}

Revision as of 08:44, 18 September 2008

Memory less systemBold text

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}
<pre> Y(t) = X(t)+X(t-1)  { with memory}

Alumni Liaison

Abstract algebra continues the conceptual developments of linear algebra, on an even grander scale.

Dr. Paul Garrett