Scribd
Upload
14 views8 pages

Control Terms1

Uploaded by

John Valenzona
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
14 views8 pages

Control Terms1

Uploaded by

John Valenzona
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

SIGNAL FLOW GRAPHS

A signal flow graph is a diagram that represents a set of simultaneous linear algebraic
equations. Each signal flow graph consists of a network in which nodes are connected
by directed branches. Each node represents a system variable, and each branch acts
as a signal multiplier. The signal flows in the direction indicated by the arrow.
Node: A node is a point representing a variable or signal.
Branch: A branch is a directed line segment joining two nodes.
Transmittance: It is the gain between two nodes.
Input node: A node that has only outgoing branche(s). It is also, called as source and
corresponds to independent variable.
Output node: A node that has only incoming branches. This is also called as sink and
corresponds to dependent variable.
Path: A path is a traversal of connected branches in the direction of branch arrow.
Loop: A loop is a closed path
Self loop: It is a feedback loop consisting of single branch.
Loop gain: The loop gain is the product of branch transmittances of the loop.
Nontouching loops: Loops that do not posses a common node.
Forward path: A path from source to sink without traversing an node more than once.
Feedback path: A path which originates and terminates at the same node.
Forward path gain: Product of branch transmittances of a forward path
Addtion rule The value of the variable designated by a node is equal to the sum of all
signals entering the node.
Transmission rule :The value of the variable designated by a node is transmitted on
every branch leaving the node.
Multiplication rule: A cascaded connection of n-1 branches with transmission functions
can be replaced by a single branch with new transmission function equal to the product
of the old ones.
Masons Gain Formula: The relationship between an input variable and an output
variable of a signal flow graph is given by the net gain between input and output nodes
and is known as overall gain of the system. Masons gain formula is used to obtain the
over all gain (transfer function) of signal flow graphs.
• Every variable in a signal flow graph is designed by a Node.
• Every transmission function in a signal flow graph is designed by a Branch.
• Branches are always unidirectional.
• The arrow in the branch denotes the direction of the signal flow.
• There are four variables in the equations (i.e., x1,x2,x3,and x4) therefore four
nodes are required to construct the signal flow graph.
• Arrange these four nodes from left to right and connect them with the associated
branches.
A signal flow graph is the graphical representation of the relationships
between the variables of set linear algebraic equations.
a) True
A node having only outgoing branches.
a) Input node
Use mason’s gain formula to find the transfer function of the given signal
flow graph:
b) abdeg/1-(bc+ef)+bcef

Use mason’s gain formula to find the transfer function of the following signal
flow graph:
b) acdfg+bcefg/1-cd-fg-cdfg
Loop which do not possess any common node are said to be ___________
loops.
c) Non touching loops
Signal flow graphs:
a) They apply to linear systems
Signal flow graphs are reliable to find transfer function than block diagram
reduction technique.
a) True
The relationship between an input and output variable of a signal flow graph
is given by the net gain between the input and output node is known as the
overall______________
a) Overall gain of the system
Use mason’s gain formula to calculate the transfer function of given figure:
b) G1+G2/1+G1H
Use mason’s gain formula to find the transfer function of the given figure:
c) G1+G2/1+G1H+G2H

1.A Error signal


2. A True
3. D Principle of Superposition
4. D Stochastic
5. A gauge
6. B Pressure
7. D Uniform
8. B 3
9. B Decreases
10. B Analog to Digital
11. D Is not the ability to control the system transient response
12. C Increase Distortion
13. A In systems where the low frequency magnitude in o dB on the bode
diagram
14. B The transient response in closed loop system decays more quickly .
15. A Noise is proportional to bandwidth
16. B Low pass filter
17. B Bandwidth
18. A more stable but less accurate
19. B The transient response to decay very fast
20. A more
21. D very large
22. B -1.11
23. A To reduce the sensitivity of the system to parameter variation
24. D No oscillation
25. D Input and feedback signal
26. C linear variant system
27. B Data is necessarily a continuous function of time at all points in the
system
28. C 2(s+2)/(s+1)
29. B n= m-2
30. C initial condition are assumed to be zero but loading is taken into
account.
31. C the system is at rest or no energy is stored in any of its part.
32. A True
33. B ABCDEG/1-(BC+EF)+BCEF
34. B ACDFG+BCEFG/1-CD-CDFG
35. C NON TOUCHING LOOPS
36. A THEY APPLY TO LINEAR
37. A TRUE
38. A OVERALL GAIN OF THE SYSTEM
39. B G1+G2/1+G1H
40. C G1+G2/1+G1H+G2H
41. D POSITIVE SIGN
42. D OUTPUT AND FEEDBACK
43. A SATURATION IN AMPLIYING STAGES
44. D SYSTEM IS AT REST
45. C THE OUTPUT FOR ANY GIVEN IPUT
46. C INCREASE BY THE SAME AMOUNT AS THE GAIN INCREASE
47. D ALL THE MENTIONED
48. D DECAYS QUICKLY
49. D THE TIME CONSTANT AND SUPRESS
50. A 0
51. C STOCHASTIC CONTROL SYSTEM
52. C LARGE NEGATIVE
53. B INTEGER MULTIPLE
54. D ALL THE MENTIONED
55. A SAMPLING
56. B WHERE HIGH
57. B MULTI ORDER SAMPLING
58. C BE LESS TO THE MESSAGE SIGNAL
59. C SIGNAL IS RECONSTRUCTED ZERO ORDER HOLDS
60. C STOCHASTIC CONTROL SYSTEM
61. D SYSTEM IS AT REST AND NO ENERGY
62. C LARGE NEGATIVE TRANFER
63. B RECONSTRUCT THE SAMPLED
64. B COMPARATOR
65. B S=IN Z/T
66. C X(Z) =Z/Z-A
67. D ALL THE MENTIONED
68. C IS TRUE BUT R IS FALSE
69. D ALL THE MENTIONED
70. A 1
71. D BOTH A AND B
72. D BOTH B AND C
73. A DISCRETE TIME SYSTEMS
74. B DISCRETE OPTIMAL CONTROL
75. A Z2/(Z+1)(Z-1)
76. D BOTH A AND B
77. C BOTH A AND B
78. A SMALL CHANGES IN THE SYSTEN INPUT DOES NOT RESULT
79. B STABLE SYSEM
80. B SYSTEM GAIN
81. B A SYSTEM NOT UNDER INFLUENCE OF INPIT
82. C BOTH A AND B
83. C NOT DEFINED
84. A ABSOLUTELY STABLE
85. B UNSTABLE
86. C WHENEVER A TRANSMISSION
87. B WITHIIN THE UNIT CIRCLE
88. C BILINEAR TRANSFORMATION
89. A HIGH SPEED
90. B 12 TO 14
91. D ALL OF ABOVE
92. A A PRODUCT OF 1ST ORDER AND 2ND
93. D NON-MINIMUM
94. D 0
95. A LIMIT THE SPEED
96. A MINIMUM PHASE TRANSFER FUNCTION
97. D ALL OF THE ABOVE
98. A SISO
99. A C(SI-A)-1B+D
100. A HOMOGENEOUS SYSTEM

You might also like