1.

B-2-3
1 a)
Steps to solve (if a, b, c, etc., these steps are interchangeable to perform):
1a) Move H
2
in front of
2
(one bloc! of H
2

2
)
1b) "ombine the t#o s$mming no%es bet#een
1
an%
2
(or tra%e the t#o. Since it is $nit& gain
bet#een the t#o , this is a legal move that maintains signal integrit&).
2a) "ombine
2
an% H
1
, then combine #ith
3
. ('ne bloc! of (
2
(H
1
)
3
).
2b) H
2

2
forms a fee%bac! loop #here this is fee%bac! gain H an% ) 1, so simplif& it to
1*(1( H
2

2
), in series #ith step 2a.
3) "ombine 2a an% 2b ('ne bloc! (
2
(H
1
)
3
*(1( H
2

2
)).
+) Step 3 forms a fee%bac! loop #ith H
3
. ,his gives &o$ one bloc! of
(
2
(H
1
)
3
*(1( H
2

2
(
2

3
H
3
(
3
H
1
H
3
) ) (
2
(H
1
)
3
*(1( H
2

2
( (
2
(H
1
)
3
H
3
)
-) Step + is in series #ith
1
. 'ne bloc! (
2
(H
1
)
1

3
*(1( H
2

2
(
2

3
H
3
(
3
H
1
H
3
)
.) Step - forms a fee%bac! loop #ith a $nit& fee%bac! loop (H ) 1). ,his gives &o$ &o$r final
ans#er: (,he ans#er is completel& factore% o$t to prove e/$alit& in part b of this problem)


1 b)

01ote: $nit& gain an% s$mming no%es bet#een
1
an%
2
permit the re%$ction to the - no%es sho#n.
2) 2 (for#ar% paths)

2. B-2-3
2a)
Steps to solve (this solves for c(s)*4(s) first)
1) 5ss$me 6(s) ) 7. ,his eliminates the s$mming no%e bet#een
1
an%
2
.
2) (,#o steps) "ombine
1
an%
2
(in series) an% H
1
(#hich completes the fee%bac! loop #ith
the first t#o). 'ne bloc! of
1

2
*(1(
1

2
H
1
).
3) (,#o steps) Step 2 is in series #ith
c
an%
3
, all of #hich forms a fee%bac! loop #ith H
2
.
8inal ans#er (belo#):

+) 5ss$me that 4(s) ) 7. 4e%ra# bloc! %iagram if nee%e%. ,his eliminates the s$mming no%e
bet#een
c
an% H
2.
"ombine
c
an% -H
2
. 'ne bloc! of -
c
H
2
. (9t is negative beca$se the
original s$mming :$nction #as a min$s H
2
).
-) Move the last pic!-off point to before
3
. ,his changes the bloc! from step 2 to -
c

3
H
2
.
.) "ombine step - #ith H
1
. 'ne bloc! of -(H
1
(
c

3
H
2
).
3) (,#o steps) Step . is in series #ith
1
, an% these t#o form a positive fee%bac! loop #ith
2
.
'ne bloc! of
2
*(1- (-
1

2
(H
1
(
c

3
H
2
))).
;) Step 3 in series #ith
3
. 8inal ans#ers:


2b)

2) 1 (for#ar% paths)


3. B-2-;

See e<ample 5-2-17 (pg -.--3). 2)1, a)7.

1) 6ivi%e bloc! %iagram into partial fraction:

2) 6efine <
1
, <
2
, an% <
3
from this (<
2
is bet#een the t#o integrators, <
1
is after the secon%
integrator, <
3
is before the s$mming :$nction)

3) "reate the matrices from the e/$ations.

+. B-2-=

8orm matrices from e/$ations:


-. B-2-17



.. B-2-11


3. B-2-12