Line 1: Line 1:
Memory less system'''Bold text'''
+
'''Memory less system'''
  
 
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}
<pre> Y(t) = X(t)+X(t-1)  { with memory}
+
Y(t) = X(t)+X(t-1)  { with memory}

Revision as of 08:45, 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}

Alumni Liaison

Basic linear algebra uncovers and clarifies very important geometry and algebra.

Dr. Paul Garrett