Line 1: Line 1:
 
'''Memoryless Systems'''
 
'''Memoryless Systems'''
 +
 
A memoryless system is one that depends only on the current input and is not affected by the past future inputs.  A good example would be the function <math>y(t) = [x(t)]^2</math>.  Here the output <math>y(t)</math> depends only on the input <math>x(t)</math> at time <math>t</math>.
 
A memoryless system is one that depends only on the current input and is not affected by the past future inputs.  A good example would be the function <math>y(t) = [x(t)]^2</math>.  Here the output <math>y(t)</math> depends only on the input <math>x(t)</math> at time <math>t</math>.
 +
 +
 +
'''Systems With Memory'''
 +
 +
A system with memory is one which does not fit the definition above for a memoryless system.  In other words it has a dependence on past or future inputs.  For example, the system <math>y(t) = 2x(t) - x(t-1)</math> has memory because the output <math>y(t)<math> depends on the input <math>x(t)<math> not only at time <math>t<math> but also at time <math>t-1<math>.

Revision as of 07:10, 19 September 2008

Memoryless Systems

A memoryless system is one that depends only on the current input and is not affected by the past future inputs. A good example would be the function $ y(t) = [x(t)]^2 $. Here the output $ y(t) $ depends only on the input $ x(t) $ at time $ t $.


Systems With Memory

A system with memory is one which does not fit the definition above for a memoryless system. In other words it has a dependence on past or future inputs. For example, the system $ y(t) = 2x(t) - x(t-1) $ has memory because the output $ y(t)<math> depends on the input <math>x(t)<math> not only at time <math>t<math> but also at time <math>t-1<math>. $

Alumni Liaison

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

Dr. Paul Garrett