Digital Signal Processing

Lecture 3
Eng’r Rianne Arne S. Reyes
Discrete Time Systems
Discrete Time Systems
• A device or algorithm that operates on a discrete time signal,
called “input” or “excitation” to produce another discrete time
signal called the “output” or “response” of the system

Input Discrete Time Output

Excitation Systems Response
x(n) y(n)

y(n) = [x(n)]
3
Input-Output Description of Systems
• Defines the relationship between the Input Signal and the
Output Signals

Example:

4
Examples

5
Accumulator
Answers
a.

b.

c.

d.

e.

f.

6
Block Diagram Representation of
Discrete Time Systems
• Adder
> Addition of 2 signal sequences to form another (the sum) sequence
> Memoryless Operation – Does not need to store one of the sequence

7
Block Diagram Representation of
Discrete Time Systems
• Constant Multiplier
> Applying a scale factor to input to form another (the product) sequence
> Multiplication Operation

8
Block Diagram Representation of
Discrete Time Systems
• Signal Multiplier
> Multiplication of 2 signal sequences to form another (the product)
sequence

9
Block Diagram Representation of
Discrete Time Systems
• Unit Delay Element
> Special system that delays the signal passing through by 1 sample
> Stores the same x(n-1) at memory at time n-1, and recalled at time n
> Requires memory

10
Block Diagram Representation of
Discrete Time Systems
• Unit Advance Element
> Moves the input x(n) ahead by one sample in time to yield x(n+1)

11
Example

12
 Classification of
Discrete Time Systems
Static vs. Dynamic Systems
• Static or Memoryless
> System output that depends on input sample at the same time (n)
> Not in pass or future samples of the input

• Dynamic or to have a Memory

> System output depends not only on input sample at the same time (n)
– opposite of Static

> Memory of Duration

• System output at time (n) is determined by the input samples at the interval from
n-N to n(N>=0)
> 0<N<infinity – Finite memory N=infinity – Infinite memory
14
Static and Dynamic Systems Examples

Static
Systems

Finite memory

Dynamic Finite memory

Systems

Infinite memory

15
Time Invariant vs Time Variant Systems
• Time Invariant Systems
> Input-output characteristics do not change with time

Shift Invariant

16
Time Invariant vs Time Variant Systems
• Time Variant Systems
> Input-output characteristics changes with time

Time Invariant

Time Variant
Output with input delayed by K Output delayed by K

17
Examples – Time Variant/Invariant
1. y(n) = T[x(n)] = x(n) – x(n-1)
Test 1- Output with Input is delayed by K
x(n) -> T[x(n)] -> y(n) = x(n)-x(n-1)
x(n-k) -> T[x(n-k)] -> y(n,k) = x(n-k) – x(n-k-1)
Test 2- Output delayed by K
y(n-k) = x(n-k)-x(n-k-1)

Since Test 1 equal to Test 2 Remember:

Y(n) = x(n) – x(n-1) is Time Invariant

Must Satisfy Above to be Time Invariant

18
Examples – Time Variant/Invariant
2. y(n) = T[x(n)] = nx(n)
Test 1- Output with Input is delayed by K
x(n) -> T[x(n)] -> y(n) = nx(n)
x(n-k) -> T[x(n-k)] -> y(n,k) = nx(n-k)
Test 2- Output delayed by K
y(n-k) = (n-k) x(n-k); nx(n-k) – kx(n-k)

Since Test 1 not equal to Test 2 Remember:

Y(n) = nx(n) is Time Variant

Must Satisfy Above to be Time Invariant

19
Examples – Time Variant/Invariant
3. y(n) = T[x(n)] = x(-n)
Test 1- Output with Input is delayed by K
x(n) -> T[x(n)] -> y(n) = x(-n)
x(n-k) -> T[x(n-k)] -> y(n,k) = x(-n-k)
Test 2- Output delayed by K
y(n-k) = x[-(n-k)] = x(-n+k)

Since Test 1 not equal to Test 2 Remember:

Y(n) = x(-n) is Time Variant

Must Satisfy Above to be Time Invariant

20
Examples – Time Variant/Invariant
4. y(n) = T[x(n)] = x(cos n)
Test 1- Output with Input is delayed by k
x(n) -> T[x(n)] -> y(n) = x(cosn)
x(n-k) -> T[x(n-k)] -> y(n,k) = x(cosn - k)
Test 2- Output delayed by k
y(n-k) = T[x(n-k)] = x(cos [n-k])

Since Test 1 not equal to Test 2 Remember:

Y(n) = x(cos n) is Time Variant

Must Satisfy Above to be Time Invariant

21
Examples – Time Variant/Invariant
5. y(n) = T[x(n)] = x(n3)
Test 1- Output with Input is delayed by k
x(n) -> T[x(n)] -> y(n) = x(n3)
x(n-k) -> T[x(n-k)] -> y(n,k) = x(n3 - k)
Test 2- Output delayed by k
y(n-k) = T[x(n-k)] = x[(x-k)3]

Since Test 1 not equal to Test 2 Remember:

Y(n) = x(n3) is Time Variant

Must Satisfy Above to be Time Invariant

22
Examples – Time Variant/Invariant
6. y(n) = T[x(n)] = cos n * x(n)
Test 1- Output with Input is delayed by k
x(n) -> T[x(n)] -> y(n) = cos n * x(n)
x(n-k) -> T[x(n-k)] -> y(n,k) = cos n * x(n-k)
Test 2- Output delayed by k
y(n-k) = T[x(n-k)] = cos (n-k) * x (n-k)

Since Test 1 not equal to Test 2 Remember:

Y(n) = cos n * x(n) is Time Variant

Must Satisfy Above to be Time Invariant

23
Examples – Time Variant/Invariant
7. y(n) = T[x(n)] = e-n * x(n)
Test 1- Output with Input is delayed by k
x(n) -> T[x(n)] -> y(n) = e-n * x(n)
x(n-k) -> T[x(n-k)] -> y(n,k) = e-n * x(n-k)
Test 2- Output delayed by k
y(n-k) = T[x(n-k)] = e-(n-k) * x (n-k)

Since Test 1 not equal to Test 2 Remember:

Y(n) = e-n * x(n) is Time Variant

Must Satisfy Above to be Time Invariant

24
Examples – Time Variant/Invariant
8. y(n) = T[x(n)] = 2n + x(n)
Test 1- Output with Input is delayed by k
x(n) -> T[x(n)] -> y(n) = 2n + x(n)
x(n-k) -> T[x(n-k)] -> y(n,k) = 2n + x(n-k)
Test 2- Output delayed by k
y(n-k) = T[x(n-k)] = 2(n-k) + x(n-k)

Since Test 1 not equal to Test 2 Remember:

Y(n) = 2n + x(n) is Time Variant

Must Satisfy Above to be Time Invariant

25
Time Variant / Invariant

Example Systems Time Invariant Conclusion

• y(n) = T[x(n)] = x(n) – x(n-1)
• y(n) = T[x(n)] = x(-n)
• y(n) = T[x(n)] = x(cos n)
• y(n) = T[x(n)] = x(n3)
• y(n) = T[x(n)] = nx(n)
• y(n) = T[x(n)] = cos n * x(n)
• y(n) = T[x(n)] = e-n * x(n)
• y(n) = T[x(n)] = 2n + x(n)

26
Time Variant / Invariant

Example Systems Time Invariant Conclusion

• y(n) = T[x(n)] = x(n) – x(n-1) • No Time Scaling
• y(n) = T[x(n)] = x(-n)
• y(n) = T[x(n)] = x(cos n)
• y(n) = T[x(n)] = x(n3)
• y(n) = T[x(n)] = nx(n)
• y(n) = T[x(n)] = cos n * x(n)
• y(n) = T[x(n)] = e-n * x(n)
• y(n) = T[x(n)] = 2n + x(n)

27
Time Variant / Invariant

Example Systems Time Invariant Conclusion

• y(n) = T[x(n)] = x(n) – x(n-1) • No Time Scaling
• y(n) = T[x(n)] = x(-n) • Coefficient should be constant
• y(n) = T[x(n)] = x(cos n)
• y(n) = T[x(n)] = x(n3)
• y(n) = T[x(n)] = nx(n)
• y(n) = T[x(n)] = cos n * x(n)
• y(n) = T[x(n)] = e-n * x(n)
• y(n) = T[x(n)] = 2n + x(n)

28
Time Variant / Invariant

Example Systems Time Invariant Conclusion

• y(n) = T[x(n)] = x(n) – x(n-1) • No Time Scaling
• y(n) = T[x(n)] = x(-n) • Coefficient should be constant
• y(n) = T[x(n)] = x(cos n) • Any added/subtracted term in the
• y(n) = T[x(n)] = x(n3) system relationship (except input and
output) must be constant or zero
• y(n) = T[x(n)] = nx(n)
• y(n) = T[x(n)] = cos n * x(n)
• y(n) = T[x(n)] = e-n * x(n)
• y(n) = T[x(n)] = 2n + x(n)

29
Linear vs Non-Linear Systems
• Linear Systems
> Satisfies the superposition principle
> Response of the system to a weighted sum of signals be equal to the
corresponding weighted sum of the responses of the system to each of
the individual input signals

30
Test Linear Systems – The Law of Superposition
• Law of Additivity

31
Test Linear Systems – The Law of Superposition
• Law of Additivity

x1(t)
+ y(t)
x2(t)
y(t) = y’(t)
x1(t)
+ y’(t)
x2(t)
32
Test Linear Systems – The Law of Superposition
• Law of Homogeneity

x(t) K y(t)

x(t) K y’(t)

y(t) = y’(t)
33
Linear vs Non-Linear Systems
• Non-Linear Systems
> Does not satisfy the superposition principle

34
Linear vs Non-Linear Systems
• Examples
1. y(n) = x(n2)
x(n) -> system -> y(n)
Output = n replaced by n2
Law of Homogeneity
x(n) ->system->’k’ -> kx(n2) = y(n)
x(n) ->’k’->system -> kx(n2) = y’(n)
y(n) = y’(n); Follows LoH
35
Law of Additivity
Test 1
x1(n) -> system -> y1(n) = x1(n2)
x2(n) -> system -> y2(n) = x2(n2)
y(n) = y1(n) + y2(n) = x1(n2) + x2(n2)
Test 2
x1(n) + x2(n) -> System -> y’(n)
y’(n) = x1(n2) + x2(n2)
y(n) = y’(n); Follows LoA
Linear
Linear vs Non-Linear Systems
• Examples
2. y(t) = x(log t)
x(t) -> system -> y(t)
Output = t replaced by log t
Law of Homogeneity
x(t) ->system->’k’ -> kx(log t) = y(t)
x(t) ->’k’->system -> kx(log t) = y’(t)
y(t) = y’(t); Follows LoH
36 Linear
Law of Additivity
Test 1
x1(t) -> system -> y1(t) = x1(log t)
x2(t) -> system -> y2(t) = x2(log t)
y(t) = y1(t) + y2(t) = x1(log t) + x2(log t)
Test 2
x1(t) + x2(t) -> System -> y’(t)
y’(t) = x1(log t) + x2(log t)
y(t) = y’(t); Follows LoA
Linear vs Non-Linear Systems
• Examples
3. y(t) = x2(t)
x(t) -> system -> y(t)
Output = input multiple to itself
Law of Homogeneity
x(t) ->system->’k’ -> kx2(t) = y(t)
x(t) ->’k’->system -> [kx(t)]2 = y’(t)
y(t) ≠ y’(t); does not follow LoH
37
Law of Additivity
Test 1
x1(t) -> system -> y1(t) = x12(t)
x2(t) -> system -> y2(t) = x22(t)
y(t) = y1(t) + y2(t) = x12(t) + x22(t)
Test 2
x1(t) + x2(t) -> System -> y’(t)
y’(t) = [x1(t)+ x2(t)]2
y(t) ≠ y’(t); does not follow LoA
Non Linear
Linear vs Non-Linear Systems
• Examples
4. y(t) = sin t x(t)
x(t) -> system -> y(t)
Output = input multiplied by sin t
Law of Homogeneity
x(t) ->system->’k’ -> ksin t x(t) = y(t)
x(t) ->’k’->system -> ksin t x(t) = y’(t)
y(t) = y’(t); Follows LoH
38 Linear
Law of Additivity
Test 1
x1(t) -> system -> y1(t) = sin t x1(t)
x2(t) -> system -> y2(t) = sin t x2(t)
y(t) = sin t [x1(t) + sin t x2(t)]
Test 2
x1(t) + x2(t) -> System -> y’(t)
y’(t) = sin t [x1(t)+ x2(t)]
y(t) = y’(t); Follows LoA
Linear vs Non-Linear Systems
• Examples Law of Additivity
5. y(n) = Ax(n) + B Test 1
x(t) -> system -> y(t) x1(t) -> system -> y1(t) = Ax1(t) + B
Output = input multiplied by A and x2(t) -> system -> y2(t) = Ax2(t) + B
added by B y(t) = Ax1(t) + Ax2(t) + 2B

Law of Homogeneity Test 2

x(t) ->system->’k’ -> kAx(t) + kB= y(t) x1(t) + x2(t) -> System -> y’(t)
x(t) ->’k’->system -> kAx(t) + B = y’(t) y’(t) = A[x1(t) + x2(t)] + B

y(t) ≠ y’(t); does not follow LoH y(t) ≠ y’(t); does not follow LoA
39 Non Linear
Linear vs Non-Linear Systems
• Examples
6. y(n) = e x(n)
x(t) -> system -> y(t)
Output = input was raised from e
Law of Homogeneity
x(t) ->system->’k’ -> ke x(n)
x(t) ->’k’->system -> e kx(n)
y(t) ≠ y’(t); does not follow LoH
40
Law of Additivity
Test 1
x1(t) -> system -> y1(t) = e x1(n)
x2(t) -> system -> y2(t) = e x2(n)
y(t) = e x1(n) + e x2(n)
Test 2
x1(t) + x2(t) -> System -> y’(t)
y’(t) = e[x1(n) + x2(n)]
y(t) ≠ y’(t); doe not follow LoA
Non Linear
Causal and Non-Causal Systems
• Causal Systems
> Output of the system at any point n is dependent only on present and
past inputs
y(n) = F [x(n), x(n-1), x(n-2)…]
• Non-Causal Systems
> Output of the system that depends not only on present and past
inputs, but also on future inputs

41
Sample Causal and Non-Causal Systems
1. y(n) = x(n) – x(n-1) • Causal
2. y(n) = x(k) + x(k-1) + … x(-inf) • Causal
3. y(n) = ax(n) • Causal
4. y(n) = x(n) + 3x(n+4) • Non-Causal
5. y(n) = x(n2) • Non-Causal
6. y(n) = x(2n) • Non-Causal
7. y(n) = x(-n) • Non-Causal

42
Stable and Unstable Systems
• Stable System
> If Bounded Input produces a Bounded Output (BIBO)

• Unstable
> Bounded Input produces an Unbounded Output

43
Stable and Unstable System
• y(t) = sin [x(t)]
• x(t) -> system -> y(t) = sin [x(t)]
Case 1:
Assume Input x(t) – bounded;
input always have a finite value
sin = with output of -1 to 1
y(n) is always between -1 to 1
44
Case 2:
Assume x(t) – unbounded;
Input can be infinite
sin = with output of -1 to 1
y(n) is always between -1 to 1
y(t) = sin [x(t)]
STABLE
Stable and Unstable System
• y(t) = x(t)/t
• x(t) -> system -> y(t) = x(t) /t
Case 1:
Assume Input x(t) – bounded;
input always have a finite value
x(t) = 2

y(n) = 2/t
when t=0; y(t) = infinity
when t is close to 0; y(t) = infinity
y(t) = x(t) / t
UNSTABLE
45
Interconnection of Discrete Time Systems
• Discrete time systems can be interconnected to form larger
systems
y1(n)
• Can be done 2 ways x(n) Ƭ1 ƬƬ2 y(n)

> Cascade (series)

Ƭc
y1(n)
Ƭ1
> Parallel x(n) + y3(n)
y2(n)
ƬƬ2
46 Ƭp
 y1(n)
Cascade Interconnection x(n) Ƭ1 ƬƬ2 y(n)

• Output is:
y(n) = Ƭ2[y1(n)]
Ƭc
y(n) = Ƭ2{Ƭ1[x(n)]}
Ƭc = Ƭ2Ƭ1 ; y(n) = Ƭc[x(n)]

Note:
Ƭ2Ƭ1 ≠ Ƭ1Ƭ2
Ƭ2Ƭ1 = Ƭ1Ƭ2 ; only if system is linear and time invariant

47
 y1(n)
Parallel Interconnection Ƭ1 y3(n)
x(n) +
y2(n)
• y3(n) = y1(n) + y2(n) ƬƬ2
= Ƭ1[x(n)] + Ƭ2[x(n)]
Ƭp
= (Ƭ1+ Ƭ2) [x(n)]
= ƬP [x(n)]

48