x(n) =0 n > N
Some Elementary Discrete-Time Signals 1 n = 0 unit sample sequence (n ) = 0 n 0 1 n 0 unit step sequence u (n ) = 0 n < 0 n n 0 unit ramp u r (n ) = 0 n < 0 exponential x(n ) = a n for all n
= r n (cos n + j sin n )
< a< 1 for real a a>1
-1 < a < o
a < -1
r is a damping factor
x(n ) = r n x(n ) = n
Energy Signal. However, many signals that have an infinite energy, have a finite average power. Average power is defined as Pave = lim
N 1 x(n ) . N 2 N + 1 N 2
E N = x(n )
N
then
E = lim En
N
Static
y (n ) = x(n k ) Dynamic-finite
k =0
y (n ) = x(n k ) Dynamic-infinite
k =0
2) y(n) = nx(n)
y(n k) = (n k) x(n k) = nx(n k) kx(n k)
Causality
A system is causal if the output at any time depends only on present and past values of the inputs and not on future values of the input. y(n) = x(-n) is non-casual because y (-1)
= x(1)!
Linearity
A system is linear if
T (a1 x1 (n ) + a2 x2 (n )) = a1T [x1 (n )] + a2T [x2 (n )]
T1 x T2 + y T= T1 + T2
10
LTI Systems
LTI systems are the most important class of systems because the behavior of the system is known by knowing its response to unit sample input (x(n)).
+ y (n ) = F {x(n )} = F x(K ) (n K ) K =
Then
K =
4 K x(K ) F [1(n24 )] = 3
h (n K )
K =
x(K ) h (n K )
= x (K ) h(n K ) = h (K ) x (n K )
this depends on future values of x(n) Hence, for a system to be casual, its h(n) must be zero for n < 0.
h(k ) x (n k )
k =
Therefore if
h(k ) <
k
system is stable. This condition is not only sufficient for stability of the system, but it is also necessary. Indeed we should show that if produce an unbounded output. Let
h(k ) = ,
k
11
x(n ) =
+
h * (n ) h(n ) 0
h(n ) 0 h(n ) = 0
h(k )
2
y (0 ) = h(k ) x( k ) =
k
h(k )
= h(k ) = y (0 ) = unbounded.
The condition
the
output of the system goes to zero as n if the input is set to zero beyond n > no. In other words, a finite excitation to the system creates an output that eventually dies out (transient response). Let's prove it. Suppose x(n ) < M x and also x(n) = 0 for n > no . Then at any n = no + N , the system output is:
y (no + N ) = + N k ) + h(k ) x(no + N k ) k = 144424443 k = N
o =0
h(k ) x (n
N 1
Q x(n ) = 0 for n no
Hence,
M x h(k )
k =N
goes to zero and hence the system is stable. Example: h(n) = anu(n) determine the range that h(n) is stable. 1) System is causal for h(n) = 0 for n < 0 2)
k =
h(k ) = a
k =0
= 1 + a + a 2 + ...
If h(n) = 0 for n > M and n < 0, then the system is called FIR (Finite duration Impulse Response); otherwise the system if called IIR.
12
FIR system has a finite memory and it only looks at the input within a window.
1 n y (n 1) + x(n ) n +1 n +1
x
1 n+1
y(n)
z-1
A Recursive System
x(n)
y(n) +
y(-1) + a x(0) + a
x(1) +
K
z-1
or
y (n ) =
a n + 1 y ( 1) 1 24 4 3
K =0 4 14 244 3
x(n K )
= y zi (n ) + y zs (n ) **
The linearity applies to each of these responses separately. This system is linear and time-invariant.
13
Impulse Response h(n) is simply equal to the zero-state response of the system.
y zs (n ) = a k x(n k ) Let x(n) = (n) then h(n ) = a k (n k ) = a n n 0
k =0 k =0 n n
Stability Example: is y(n) = a y(n-1) + x(n) stable? Given a bounded input: x(n ) M x < for all n 0 , from (**) we have
y (n ) a
n +1
y ( 1) +
a x(n k ) a
k k =0
n +1
y ( 1) + M x
1 a
n +1
1 a
= My