‫بسم هللا الرحمن الرحيم‬

Third Year - 2020

Signals and Systems

Lecture (4): Systems
 Outline

• What is a System?
• Interconnection of Systems
• Types of systems
– Memory vs. Memoryless Systems
– Stability
– Invertibility
– Linearity
– Time-Invariance
– LTI Systems
2
 What is a System?
 System: an entity or operator that manipulates
one or more signals to accomplish a function,
thereby yielding new signals.
CT
x(t) y(t) x(t )  y (t)
H
Input Output y (t) = H (x (t))
Signal Signal

3
 What is a System?
DT x[n]  y[n]

y [n] = H (x [n])

x[n] y [n] = T{x [n]}

y[n]
H

Input Output
Signal Signal
4
 What is a System?
A Hybrid system

a(t)  a[n]

a(t) a[n]
sampling

5
 Interconnection of Systems
1. Series (or cascade) Connection:
y1(t) = H1(x1 (t)) , y2(t) = H2(x2 (t))
y(t) = H2( H1( x1 (t) ) )

x(t)=x1 (t) y1(t)=x2 (t) y(t)=y2 (t)

H1 H2
x(t) y(t)

e.g. a radio receiver followed by amplifier

6
 Interconnection of Systems
2. Parallel Connection:
y(t) = H2( x(t) ) + H1( x(t) )

x(t) H1 y(t)
+
H2

e.g. an audio system with several

microphones feeding into the same
amplifier.
7
 Interconnection of Systems (cont’d)
3. Feedback Connection:

x(t) y(t)
+ H1

H2
• e.g. cruise control
8
 Interconnection of Systems (cont’d)
• Possible to have combinations of connections..

x(t) y(t)
+ H1 H3

H2

9
Examples of Systems

10
Examples of Systems

11
Examples of Systems

12
Observation

13
14
15
 Types of Systems

All of the following properties apply equally

to continuous-time and discrete-time
systems.
• Causality
• Memory
• Stability
• Invertibility
• Linearity
• Time-invariance
16
 Causality
A system is causal if the output does not
anticipate future values of the input, i.e

17
Causality

18
Causality

19
 Examples

1)

2)

3)

4)
20
 Examples

1)

2)

21
 Examples

3)

4)

22
 1. Memory vs. Memoryless Systems
• Memory (or dynamic) Systems: System
output y(t) depends on input at past or future
of the current time t.
• Memory system: present output value
depend on future/past input.

• Memoryless system: present output value

depend only on present input.

23
 Note

• Memoryless system can be causal, but

causal not necessarily be memoryless.

24
1. Memory vs. Memoryless Systems
(cont)
• Examples of Memoryless systems:
– A resistor:y(t) = R x(t)

• Examples of Memory systems:

t
1
– A capacitor: y (t )   x( )d
C 

– A one unit delayer: y[n] = x[n-1]

n

25
y[n]   x[k ]
– k  
 2. Stability

• Stability: A system is stable if it results in a

bounded output for any bounded input, i.e.
bounded-input/bounded-output (BIBO).
If |x(t)| < k1, then |y(t)| < k2.
Examples of stable systems:
t
y (t )   x(t )dt y[n ]  100 x[n ]
0

Unstable systems:
y (t )  Kr(t ) where r (t ) 26 tu (t ) y[n ]  nx[n ]
 3. Invertibility

• Invertibility: A system is invertible if distinct

inputs result in distinct outputs.
• If a system is invertible, then there exists an
“inverse” system which converts output of the
original system to the original input.

x(t) y(t) w(t)=x(t)

Inverse
System
System

27
 3. Invertibility (cont)

• Examples: y (t )  4 x(t )
1
w(t )  y (t )
4
t
y (t )   x(t )dt
n
y[n]   x[k ]
k  


w[n]  y[n]  y[n  1] dy (t )

w(t ) 
dt

28
 4. Linearity
A system is linear if it satisfies the following
properties:
1. Additivity:
If x1(t)  y1(t) and x2(t)  y2(t)
x(t) = x1(t) + x2(t)  y(t) = y1(t) + y2(t)

2. Homogeneity (or scaling):

x(t) = a x1(t)  y(t) = a y1(t),
for a any complex constant.
29
 4. Linearity (cont)

• The two properties can be combined into a single

property:

Superposition:
x(t) = a x1(t) + b x2(t)  y(t) = a y1(t) + b y2(t)

x[n] = a x1[n] +b x2[n]  y[n] = a y1[n] + b y2[n]

30
 4. Linearity (cont)
• Example: Ideal op-amp circuit (integrator)

31
 4. Linearity (cont)

• How do you check linearity of a given system?

Exercise: Are the following systems linear?

y (t )  x (t )
2

y[n]  nx[n]
y (t )  x(t ) cos(t )
32
 Example
Linear ?

33
 Example

1 2

34
 5. Time-Invariance
• A system is time-invariant if a delay (or a
time-shift) in the input signal causes the same
amount of delay (or time-shift) in the output
signal, i.e.:

x(t) = x1(t-t0)  y(t) = y1(t-t0)

x[n] = x1[n-n0]  y[n] = y1[n-n0]

35
 5. Time-Invariance (cont)
Exercise: Check if the following systems are
time-invariant:

y[n]  nx[n]
y (t )  x(2t )

36
 Example
Time Invariant ?

37
Example

38
 A special Type of Systems

• A Linear Time-Invariant System (LTI)

39
 LTI Systems
The Superposition Theorem:
For an LTI system If x(t)  y(t),
it is possible to figure out response of the
system to any signal x1(t) that can be obtained
by “scaling” or “time-shifting” the input signal
x(t), i.e.:

x1(t) = a0 x(t-t0) + a1 x(t-t1) + a2 x(t-t2) + … 

y1(t) = a0 y(t-t0) + a1 y(t-t1) + a2 y(t-t2) + …
40
 Superposition in LTI Systems
• A Very useful property since it becomes
possible to solve a wide range of problems.
• This property will be basis for many other
techniques that will be covered throughout the
rest of the course.

41
 Next Lecture

• Convolution

42