circuit and system analysis · 2021. 3. 29. · block diagram reduction we now consider the forms...

23
Circuit and System Analysis EHB 232E Prof. Dr. M¨ stak E. Yal¸ cın Istanbul Technical University Faculty of Electrical and Electronic Engineering [email protected] Prof. Dr. M¨ stak E. Yal¸ cın ( ˙ IT ¨ U) Circuit and System Analysis Spring, 2020 1 / 23

Upload: others

Post on 01-Apr-2021

0 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Circuit and System AnalysisEHB 232E

Prof. Dr. Mustak E. Yalcın

Istanbul Technical UniversityFaculty of Electrical and Electronic Engineering

[email protected]

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 1 / 23

Page 2: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Outline I

1 Block diagrams and signal-flow graphBlock diagramsBlock diagram reductionFeedbackExampleSignal-Flow Graphs

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 2 / 23

Page 3: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

The elements of block diagrams

Block diagrams are ways of representing relationships between signals in asystem.

A block diagram is a representation of a system using blocks.

Block Y (s) = T (s)X (s) summing junction picko↵ point

T(s)X(s) Y(s) X

X

1

2

Y(s)=X + X1 2

X(s)

X(s)

Output Y (s), block gain T (s), input X (s)

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 3 / 23

Page 4: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Block diagrams

aX (s)

d

X (s)

b c1

2

z z1 2 Y(s)

z1 = aX1(s) + X2(s) + dz2

z2 = bz1(s)

andY (s) = cz2(s)

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 4 / 23

Page 5: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Block diagram reduction

We now consider the forms in which blocks are typically connected andhow these forms can be reduced to single blocks.Cascade Form & Parallel Form

GX(s)

HY(s)

G HY(s)X(s)

.

GX(s)

GX(s)

G

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 5 / 23

Page 6: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Feedback block

GX(s)

H

Y(s)

+-

u = X (s)± H(s)Y (s)

Y (s) = G (s)u

Y (s) =G (s)

1⌥ G (s)H(s)X (s)

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 6 / 23

Page 7: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Example

Reduce the following system to a single block:

X (s) Y(s)A B C

D

E-

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 7 / 23

Page 8: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Example

X (s) Y(s)A BC

D

E

-

Y (s)

X (s)=

ABC1�AD

1 + ABCE1�AD

When reducing subsystems in cascade form adjacent subsystems are assumed that

do not load each other. Hence, a subsystem’s output remains the same no matter

what the output is connected to. If another subsystem connected to the output

modifies that output, we say that it loads the first system.

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 8 / 23

Page 9: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Signal-Flow Graphs

XX

X

X

1

2

3

412t

13t 43t

23t

Signal-flow graphs are an alternative to block diagrams. They consist ofedges which represent systems and nodes which represent signals. Multipleedges converging on a node implies summation.

X3 = t23X2 + t13X1 + t43X4

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 9 / 23

Page 10: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Signal-Flow Graphs

We can convert the cascaded and parallel forms into signal-flow graphs:

X

a1

X1 2

a2

X

a1

X1 2

a2+

X

a1

X1 2

a2X

a1

X1 2

a2

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 10 / 23

Page 11: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Signal-Flow Graphs

X a1

X

1

2 a2

X3a3

X a1

X

1

2 a2

X3

a3

a3

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 11 / 23

Page 12: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Signal-Flow Graphs

We can convert the feedback form into signal-flow graph:

X

a0a2

a1 a31

X2 X3

X

a2

a1/1-a31

X2 X3a0 /1-a3

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 12 / 23

Page 13: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Signal-Flow Graphs

Reducing to a single edge:

X-a /s

a a

-b /s0

1 2

1 1

0

21+s+b1

Y

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 13 / 23

Page 14: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Signal-Flow Graphs

X-a /s

a a

-b /s0

1 2

1 1

0

21+s+b1

Y

X-a /s

a a

-b /s

0

1 2

1

0

21+s+b1

Y

X-a /sa

a

-b /s

01

2

1

0

21+s+b1

Y

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 14 / 23

Page 15: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Signal-Flow Graphs

X-a /sa

a

-b /s

01

2

1

0

21+s+b1

Y

X+a /s-a

a

b /s

01

2

1

0

1+s+b1

Y

X+a /s-a

a

b /s

01

2

0

1+s+b1

Y

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 15 / 23

Page 16: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Signal-Flow Graphs

X-a /s

a a

-b /s0

1 2

1 1

0

21+s+b1

Y

X+a /s-a +a01 2

1+s+b+ b /s1

Y

0

Y

X=

�a1 + a2 +a0s

1� (1 + s + b1 +b0s )

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 16 / 23

Page 17: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Mason’s gain formula

Mason’s gain formula (MGF) is a method for finding the transfer functionof a linear signal-flow graph (SFG) The gain formula is as follows:

XN

X1=

PTk�k

� = 1�X

Pj1 +X

Pj2 �X

Pj2 + · · ·+ (�1)kX

Pjk

where � = the determinant of the graph.X1 = input-node variableXN = output-node variableTk = gain of the kth forward path between input and outputPj1 = loop gain of each closed loop in the systemPj2 = product of the loop gains of any two non-touching loops (nocommon nodes)Pj3 = product of the loop gains of any three pairwise nontouching loops�k = the cofactor value of � for the kth forward path, with the loopstouching the kth forward path removed.Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 17 / 23

Page 18: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Mason’s gain formula

X

1 1 1 1 1 1

a b c d e f

� = 1� (a+ b + c + d + e + f ) + (ac + ad + ae + af + bd

+ be + bf + ce + cf + df )� (ace + acf + bdf + adf )

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 18 / 23

Page 19: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Mason’s gain formula

Xa

-a a

b 0

2 1

1 1

0

21+s+b1

Y

1+s

X4X1

gain of the kth forward path between input X1 and output X4

T1 = a0

T2 = �a2

T3 = a1

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 19 / 23

Page 20: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Mason’s gain formula

Xa

-a a

b 0

2 1

1 1

0

21+s+b1

Y

1+s

� for the kth forward path

�1 = 1

�2 = 1� (1 + s)

�3 = 1� (1 + s + 2) + (1 + s)2

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 20 / 23

Page 21: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Mason’s gain formula

Xa

-a a

b 0

2 1

1 1

0

21+s+b1

Y

1+s

� for signal-flow

� =1� (1 + s + 2 + 1 + s + b1 + b0) + 2(1 + s) + 2(1 + s + b1)

+ (1 + s)(1 + s + b1)� (1 + s)(1 + s + b1)2.

HenceX4

X1=

PTk�k

�=

a0 + a2s + a1s

�(s2 + b1s + b0)

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 21 / 23

Page 22: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Mason’s gain formula

Xa

a s+a

b 0

2 1

1 1

0

21+s+b1

Y

1+s

YX ;

T1 = a0

T2 = a2s + a1

�1 = 1

�2 = 1� (1 + s + 2) + 2(1 + s)

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 22 / 23

Page 23: Circuit and System Analysis · 2021. 3. 29. · Block diagram reduction We now consider the forms in which blocks are typically connected and how these forms can be reduced to single

Mason’s gain formula

Xa

a s+a

b 0

2 1

1 1

0

21+s+b1

Y

1+s

� =1� (1 + s + 2 + 1 + s + b1 + b0) + 2(1 + s) + 2(1 + s + b1)

+ (1 + s)(1 + s + b1)� 2(1 + s)(1 + s + b1)

=� s2 � b1s � b0

Y

X= �a2s

2 + a1s + a0

s2 + b1s + b0

Prof. Dr. Mustak E. Yalcın (ITU) Circuit and System Analysis Spring, 2020 23 / 23