ANALYSIS & SYNTHESIS OF CIRCUITS

2008-2009

CONTENT
Chapter 1. Topology of circuits Chapter 2. Flowgraphs Chapter 3. State-equations Chapter 4. Stability analysis Chapter 5. Description of electric circuits Chapter 6. Passive one-ports Chapter 7. Passive two-ports Chapter 8. Impedance matching circuits Chapter 9. Passive filters Chapter 10. Synthesis of circuits

Prof. dr. ing. Marina TOPA

Components of the mark (100 points = mark 10)

During the semester (50 points+10 points) tests regarding theoretical knowledge TC:3 tests x 5p=15p tests regarding solution of problems (applications) TS:3 tests x 5p=15p tests regarding practical skills (labs) NL: 10p participation at courses AC: 10p ! An additional test (TC4+TS4) Final exam (50 points) theory multiple-choice questions problems Final mark N=(TC+TS+NL+AC+E)/10

E: 10p 20p 20p

Tests regarding theoretical knowledge

1. 2. 3. 4.

TC1(C1, C2) TC2 (C3, C4) TC3 (C5,C6, C7) TC4 (C8, C9)

23.03.09 06.04.09 04.05.09 18.05.09

Prof. dr. ing. Marina TOPA

References
-for lecture-

V. Popescu, Semnale, circuite i sisteme, Partea I. Teoria semnalelor, Editura Casa Cartii de Stiinta, Cluj-Napoca, 2001. Marina Topa, Semnale, circuite i sisteme, Partea a II-a. Teoria sistemelor, Editura Casa Cartii de Stiinta, ClujNapoca, 2002. Gh. Cartianu, M. Svescu, I. Constantin, D. Stanomir, Semnale, circuite i sisteme, Editura didactic i pedagogic, Bucureti, 1980. Adelaida Mateescu, N. Dumitriu, L. Stanciu, Semnale i sisteme. Aplicaii n filtrarea semnalelor, Editura Teora, Bucureti 2001. A.V. Oppenheim, A. S. Willsky, I. T. Young, Signals and Systems, Prentince-Hall, 1983. A. D. Poularikas, S. Seely, Signals and Systems, PWS Publishers, Boston, 1985.

References
-for applications-

Adelaida Mateescu, D. Stanomir (coordonatori), Probleme de analiza i sinteza circuitelor, Editura tehnic, Bucureti, 1976. M. Svescu, T. Petrescu, S. Ciochin, Semnale, circuite i sisteme. Probleme. Editura didactic i pedagogic, Bucureti, 1981. Ioana Popescu, Victor Popescu, Erwin Szopos, Marina opa, Semnale, circuite i sisteme. ndrumtor de laborator IV, Editura Casa Crii de tiin, Cluj-Napoca, 2003.

References
- for the applications -

Adelaida Mateescu, D. Stanomir (coordonatori), Probleme de analiza i sinteza circuitelor, Editura tehnic, Bucureti, 1976. M. Svescu, T. Petrescu, S. Ciochin, Semnale, circuite i sisteme. Probleme. Editura didactic i pedagogic, Bucureti, 1981. Ioana Popescu, Victor Popescu, Erwin Szopos, Marina opa, Semnale, circuite i sisteme. ndrumtor de laborator IV, Editura Casa Crii de tiin, Cluj-Napoca, 2003.

Course 1. Topology of circuits Course 2. Flowgraphs Course 3. State-equations Course 4. Stability analysis

CONTENT

Course 5. Description of electric circuits Course 6. Applications I Course 7. Passive one-ports Course 8. Passive two-ports Course 9. Impedance matching circuits Course 10. Applications II Course 11. Passive filters Course 12. Passive filters & Synthesis Course 13. Synthesis of circuits Course 14.Applications III
Prof. dr. ing. Marina TOPA

Course 1. Topology of electric circuits

1.1 The approach of topology 1.2 Topological graphs 1.3 Matrix description of topological graphs 1.4 Matrix equations of electric circuits

Prof. dr. ing. Marina TOPA

Analysis & Synthesis of Circuits -1

1.1 The approach of topology Network topology deals with those properties of lumped networks which are related to the interconnection of branches only. Graph theory = mathematical discipline which deals with network topology !

Prof. dr. ing. Marina TOPA

Analysis & Synthesis of Circuits -1

1.1 The approach of topology

1 (1) (2) 2 4 (4) 5 3 6 (3) (1) 4 2 1 (2) 5 (4) 3 2 (2) 6 5 (4) 4 (3) 1 (1) 6 3

(3)

Oriented (directed) graphs Nonoriented (undirected) graphs The directed graph Gd associated with the given circuit C is obtained by replacing each two-terminal element by a line segment, called edge with an arrow in the same direction as the assumed positive current through that edge.

Prof. dr. ing. Marina TOPA Analysis & Synthesis of Circuits -1

1.2 Topological graphs

Path = a set of edges b1, b2, , bn in Gn is called a path between two nodes Vl and Vk if the edges can be labeled such that: 1.Consecutive edges bi and bi+1 always have a common endpoint. 2.No node of Gn is the endpoint of more than two edges in the set. 3.Vj is the endpoint of exactly one edge in the set, and so is Vk. A path = a route between two nodes.
1 (2) 5 (4) 3 1 (2) 5 (4) 3 1 (2) 5 (4) 3

(1) 4

(3) 6

(1) 4

(3) 6

(1) 4

(3) 6

Prof. dr. ing. Marina TOPA

Analysis & Synthesis of Circuits -1

1.2 Topological graphs

A directed graph Gn is said to be connected if there exists a path between any two nodes of the graph.
1 (2) 5 (4) 3

(1) 4

(3) 6

If a directed graph Gn is not connected, it consists of a number of connected subgraphs.

Notations: l=nr of edges in the circuit n=number of nodes of the circuit; s=number of connected subgraphs for a not connected graph).
Prof. dr. ing. Marina TOPA Analysis & Synthesis of Circuits -1

1.2 Topological graphs

Loop = a subgraph Gs of a graph Gn where : 1. Gs is connected. 2. Every node of Gs has exactly two incident edges of Gs.

1 (2) 5 (4) 3

1 (2) 5 (4) 3

1 (2) 5 (4) 3

(1) 4

(3) 6

(1) 4

(3) 6

(1) 4

(3) 6

Prof. dr. ing. Marina TOPA

Analysis & Synthesis of Circuits -1

1.2 Topological graphs

Tree = a subgraph Gs of a connected graph Gn where: 1. Gs is connected. 2. Gs contains all nodes of Gn. 3. Gs has no loops. Tree branches = edges in a tree. Links (chords) = edges which do not belong to a tree. Cotree = all the links of a given graph.
1 (2) 5 (4)
Prof. dr. ing. Marina TOPA

1 3 (2) 5 (4) 3

1 (2) 5 (4)
Analysis & Synthesis of Circuits -1

(1) 4

(3) 6

(1) 4

(3) 6 4

(3) 6

1.2 Topological graphs

Cutset = a set of branches of a connected graph Gn where: 1. The removal of the set of branches (but not their endpoints) results in a graph that is not connected. 2. After the removal of the set of edges, the restoration of any branch from the set will result in a connected graph again.
1 (2) 5 (4) 3 1 (2) 5 (4) 3 1 (2) 5 (4) 3

(1) 4

(3) 6

(1) 4

(3) 6 4

(3) 6

Prof. dr. ing. Marina TOPA

Analysis & Synthesis of Circuits -1

1.2 Topological graphs

Fundamental loop = a loop which contains only one link
1 2 b4 4 (4) b1 (2) 3

(1)

(3) 6

5 b6

Fundamental cutset = a cutset which contains only one tree branch

1 2 (1) 4 (4) 5 2 (2) 5 6 3 3 (3)

Prof. dr. ing. Marina TOPA

Analysis & Synthesis of Circuits -1

1.3 Matrix description of topology

Incidence matrix = a (n x l) matrix for a directed graph Gd with n nodes and l edges:
A a = [aij ] where: aij = 1 if edge j is incident at node i and the arrow is pointing away from node i aij = 1 if edge j is incident at node i and the arrow is pointing toward node i aij = 0 if edge j is not incident at node i

1
2 3 5 1 4 6

(1) 4

(2) 5 (4)

(3) 6

1 1 0 0 1 1 0 2 1 1 1 0 0 0 Aa = 3 0 1 0 1 0 1 4 0 0 1 0 1 1

Prof. dr. ing. Marina TOPA

Analysis & Synthesis of Circuits -1

1.3 Matrix description of topology

Reduced incidence matrix = the incidence matrix after deletion of s lines, where s is the number of the connected parts. Obs.: for a connected graph s=1

1 (2) 5 (4) 3

2
(3) 6

5 0 1

6 0 0 1

(1) 4

1 1 0 2 1 1 A= 3 0 1

1 1 0 0 0

0 1

Prof. dr. ing. Marina TOPA

Analysis & Synthesis of Circuits -1

1.3 Matrix description of topology

Loop (circuit) matrix B = a (nl x l) matrix for a directed graph Gd with nl nodes and l edges:
B = [bij ] where: bij = 1 if edge j is in loop i and their directions agree bij = 1 if edge j is in loop i and their directions oppose bij = 0 if edge j is not in loop i
1 (2) 5 (4) 3

1 2 3 4 5 6
(3) 6

(1) 4

2 bi

B=

bi

0 0 1 0

Prof. dr. ing. Marina TOPA

Analysis & Synthesis of Circuits -1

1.3 Matrix description of topology

Fundamental (basic) loop matrix Bf = a submatrix of B that consists of the maximum number of independent rows of B; it shows the relationship fundamental loops-edges. Bf is a (l-n+s) x l matrix.
1 2 b4 4 (4) b1 (2) 3

1
(3) 6

(1)

Bf =

5 b6

b1 1 1 1 0 0 0 b4 0 1 0 1 1 0 b6 0 0 1 0 1 1

If the branches and links are grouped, then: Bf = [ Br

2 3 5 1 4 6 Bf = b1 1 1 0 b4 1 0 1 b6 0 1 1 1 0 0 0 1 0 0 0 1

Bc ]

B c = 1c

Prof. dr. ing. Marina TOPA

Analysis & Synthesis of Circuits -1

1.3 Matrix description of topology

Cutset matrix Q = a (nc x l) matrix for a directed graph Gd with nc nodes and l edges:
Q = [qij ] where: qij = 1 if edge j is in cutset i and their directions agree qij = 1 if edge j is in cutset i and their directions oppose qij = 0 if edge j is not in cutset i
1 i (1) 4 (2) 5 (4) 3

1
(3) 6

Q=

1 0 0 1 1

Prof. dr. ing. Marina TOPA

Analysis & Synthesis of Circuits -1

1.3 Matrix description of topology

Fundamental cutset matrix Qf = a submatrix of Q that consists of the maximum number of independent rows of Q; it shows the relationship fundamental cutsets-edges.
1 2 (1) 4 (4) 5 2 (2) 5 6 3 3 (3)

1 Qf =

2 1 1 0 1 0 0 3 1 0 1 0 0 1 5 0 0 0 1 1 1

If the branches and links are grouped, then: Qf = [Qr

2 3 5 1 4 6 Qf = 2 1 0 0 3 0 1 0 5 0 0 1 1 1 0 1 0 1 0 1 1

Qc ]

Q r = 1r

Prof. dr. ing. Marina TOPA

Analysis & Synthesis of Circuits -1

1.3 Matrix description of topology

Relationships between the topological matrices
Bf AT = 0; ABf T = 0 Bf = [ Br

1c ] ; Qf = [1r

Q c ] ; B r = Q T . c

Topological equations of circuits

I Kirchhoff A i (t ) = 0; A I ( s ) = 0; Qf i (t ) = 0; Qf I ( s ) = 0; i r (t ) = Qc i c (t ) = B r i c (t )
T

II Kirchhoff u(t ) = Av(t ); U( s ) = AV( s ); B f u (t ) = 0 ; B f U ( s ) = 0;

T u c (t ) = B r u r ( t ) = Q c u r ( t )

i (t ) = BT i c (t ); I ( s ) = BT I c ( s ) f f

u (t ) = QT u r (t ); U ( s ) = QT U r ( s ) f f

Prof. dr. ing. Marina TOPA

Analysis & Synthesis of Circuits -1

Ohms law
Jij

(i)

Iij

Eij

Zij

U ij ( s ) + Eij ( s ) = Z ij ( s ) I ij ( s ) + J ij ( s ) ;
(j)

I ij ( s ) + J ij ( s) = Yij ( s ) U ij ( s ) + Eij ( s ) ;

U Zij

For linear circuits with passive elements and real sources, but no mutual inductances:

U ( s ) + E ( s ) = Z ( s )[ I ( s ) + J ( s )] I ( s ) + J ( s) = Y ( s )[U ( s ) + E ( s )]

where Z(s) and Y(s) are diagonal.

Prof. dr. ing. Marina TOPA

Analysis & Synthesis of Circuits -1

1.3 Matrix equation for linear passive circuits

I Elementary method

I Kirchhoff: Q f I ( s ) = 0 A I ( s ) = 0; II Kirchhoff: Bf U( s ) = 0 B f Z( s )I ( s ) = B f (E( s ) Z( s )J ( s )) Ohm's law: U( s ) + E( s ) = Z( s )[I ( s ) + J ( s )] 0 A I ( s ) = B (E( s ) Z( s )J ( s )) B f Z( s ) f

II Nodal method
Dimension : 2l

I Kirchhoff: A I ( s ) = 0 U ( s ) = AT V ( s ) T II Kirchhoff: U( s ) = A V ( s ) AJ ( s ) = AY( s )[U( s ) + E( s )] Ohm's law: I ( s ) + J ( s ) = Y( s )[U( s ) + E( s)] AY( s ) AT V ( s ) = AJ ( s ) AY( s )E( s ) Yn ( s )V ( s ) = J scn ( s )
Prof. dr. ing. Marina TOPA

Dimension : n-s
Analysis & Synthesis of Circuits -1

1.3 Matrix equation for linear passive circuits

III Loop (mesh) method

I(s) = B f T I c (s) II Kirchhoff: Bf U( s ) = 0 B f Z( s )I ( s ) = B f (E( s ) Z( s )J ( s )) Ohm's law: U( s ) + E( s ) = Z( s )[I ( s ) + J ( s )] B f Z ( s ) B f T I c ( s ) = B f E( s ) B f Z ( s ) J ( s ) Z c ( s )I c ( s ) = E c ( s )

II Branch-based method
Dimension : l-n+s

I Kirchhoff: I ( s ) = B f T I c ( s )

I Kirchhoff: Q f I ( s ) = 0 U(s) = Q f T U r ( s) II Kirchhoff: U( s ) = Q f T U r ( s ) Q J ( s ) = Q f Y ( s )[U ( s ) + E( s )] Ohm's law: I ( s ) + J ( s ) = Y( s )[U ( s ) + E( s )] f Q f Y ( s )Q f T U r ( s ) = Q f J ( s) Q f Y ( s )E( s ) Yr ( s )U r ( s ) = J scr ( s )

Dimension : n-s
Analysis & Synthesis of Circuits -1

Prof. dr. ing. Marina TOPA

Questions

1. Draw two circuits having the same topological graph. 2. Define in your own words an edge and a node in a directed graph. 3. Draw a graph composed of 7 edges and point out its paths (loops, cutsets). 4. Draw a not connected directed graph having 2 connected subgraphs. 5. Draw a graph composed of 7 edges and choose a tree. Point out the fundamental loops and cutsets. 6. Draw a graph having at least a cutset that is not placed around a node. 7. Draw a graph composed of 7 edges and choose a tree. Compute the reduced incidence matrix (fundamental loop matrix, fundamental cutset matrix). 1 0 0 1 1 0 8. If the reduced incidence matrix is:
A=0 1 0 1 1 1 0 0 0 0 1 1

draw the corresponding topological graph. 1 9. If the fundamental loop matrix is: B = 0
f

1 0 0 0 1 0 0 1 0 0 0 1 1 0 0 1 0 1 0 1 0 0 0 1 0 0 0 0 0 1 1 0 0 0 0 1

draw the corresponding topological graph. 1 10. If the fundamental cutset matrix is: 0
Qf =

0 0 1 0 0 0 0 1

0 1 1 0 0 1 1 0 0 1 1 0

draw the corresponding topological graph.

Prof. dr. ing. Marina TOPA Analysis & Synthesis of Circuits -1

Questions

10. Draw a circuit having 5 edges and find the topological matrices. 11.Write the impedance (admittance) matrix, the voltage and current sources vectors for the circuit in the figure below. 12. Which of the matrix equations methods are more appropriate to be used for the circuit in the figure below? 13. Write the nodal (elementary, mesh, branch-based) equations for the circuit in the figure below. 14. Find the current and voltages vectors considering the nodal (elementary, mesh, branch-based) equations of a circuit.
1 (2) 2 4 (4) 5 3 6 (3) (1) 4 (2) 5 (4) 3 3 2 (2) 6 5 (4) 4 (3) 1 (1) 6

1 (1) 2

(3)

Prof. dr. ing. Marina TOPA

Analysis & Synthesis of Circuits -1