Chapter Seven Solutions Loa B coy q q’* Cc x x x=0 xe1 D ABY A-B | C-D A-B B c CD | AB A-B A and B are equivalent, and C and D are equivalent. b. B q q°q a z x=0 x= A c A 0 c c F 1 F A A 0) f. 8 [ BDF © | re ae od | pce [cr,pe[ x —E | Ber | DF x CF F x x DE A B c D Since B cannot be grouped with either C or F, A is by itself. But, C and F require D and E, and D and E require C to be with F. Those groupings allow B to be grouped with D and E, giving q q° z x=0 xe B B 0 B ic B 0 c B A 1Since B and D are grouped the table reduces to B x c |Bo,cr| x D x v x e [er tT x CDF x F /e8D,Ac| x AF x [AC,DF A B c D E and neither C and D, nor B and F, nor D and F can, B c [er [x] D x v x E x x x x F[ ac x AF x x A B c D E From this reduced table, we can see that A, C and F can be in one group, The resulting state table is and B and D in another.B Xx c [ecorl x D X x E Vv x x F [Bay x x BGY ae [ x E x x x A B c D E F Since D and F cannot be grouped, we have A-E-F and B-G, leaving C and D by themselves. The state table becomes q q* z x50 xe1 |x=0 x21 A B D 7:20 B A B 1 ° c B A o 0 D A c 1 1 i. B Xx c CDE Oo] eF x x E ACF | AD,EF F coF | EF x AD A B c D E Clearly, A and D can be grouped, as can E and F. B must be alone. That allows C to be grouped with E and F, producingq q° z x20) xe Cc B oO B c B 1 ce A B 1 i. B x c x EFY D x |AG,BE|AGBF — |eBcoc] x x | F DGyV x x x BCYV a [ x [aceelacerl V x A B Cc D E F There are no conditions on grouping D and G. That allows A to be grouped with F. B and C are grouped along with E and F, producing three states, A-E-F, B-C, and D-G. q a. z x=0 B D 0 B A 1Game dse a G2 43, a -CEER c4Orro A852 oe -ChT== ~{-p<]xpx eS -s = Tose o “Toor es oc __ =[ebele sepR poe ogi onze “#38552 sy i ete -|-l=le}= ~|_Ixlklz os SHH gest te oZsre e e e x e+ es x x Crt oe +889 ges xx og oon? -sot adanqe" 43" a" G2 4s qa xq, xq, q,03.02 O11 10g Gx.00 or 1 x xTx]— |-lx - +o ore r|x x xf-| - rl [x - +o ore -|-|* [x fo] x|x x orre eore 2 -|x x] xf -[- x x orreo eoorr D, =x Dy = x + ay! Dg = x'qy +X! Gy’ +X Gy" do + (42! qo! OF G' Go’) qs,a. (AB) > (C D) (BC) > Py (Ac) > 1 > +P, = (AC) (8) (0) (AD) > (AC) 3 +P, = (ACD) (8) (BC) > (AD) > Py (BD) > (AD) (BC) > Py (CD) ov ~ > Ps = (A) (B) (CD) There are no new terms produced by the sums. b. (AB) > (CD) > +P, = (AB) (CD) (AC) > (BD) > +P, = (AC) (BD) (AD) > (CD) > (AB) > Py (BC) > (CD) > Py (BD) > (AC) > >P, (C D) > (AB) 3 oP, There are no new terms produced by the sums. °. (AB) > (CD) > +P; = (AB)(CD) (AC) > (BD) > + Py = (AC) (BD) (AD) > ¥ > +P = (AD) (8) (C) (BC) >V > +P, = (A) (BC) (D) (BD) (AC) > >P, (CD) > (AB) + Py Ps = Ps + P, = (AD) (BC) 4. (AB) > (CD) > (8C) 3 Py (AC) > (BD) > +P, = (AC) (BD) (AD) > (CD) > >Py (BC)>V > +P, = (A) (BC) (D) (BD) >¥ > > Ps = (A) (BD) (C) (CD) > (8C) +> > P, = (A) (BCD)e. (AB) > (EF) (BC) > (DE) (AC) > (DF) (BC) (AD) > (CF) (AB) (AE) > (BC F) (ADE) (AF) > ¥ (BC) > (DE) (ABC) (BD) (ACE) (BE)>V (BF) > (E) (BC) (CD) > (ACD) (CE) > (8D) (CF) > (AD) (BC) (DE) > (ABC) (DF) > (ABC) (DF) > (ABC) Hlbb bebe sburyig oP, =P, > Py > Px Pp Py > Py > Ps > Py > Py Py > Py =P, Py Py Pg = Po + Ps = (AF) (BE) (C) (0) f. (AB) > (BDF) > (DE) (CD) (AC) > (ABD) (AD) > (ABDE) (AE) > (CD) (AF) > (BC) (BC) 3 (AF) (BD) > (EF) > (BCD) > (AEF) (BE) > (CF) > (BD) 3 (ACD) (BF) + (CDF) (CD) 3 (AE) (CE) 3 (AC) (BD) (CF) > (ACD) (DE) >(BCDE) (DF) > (BCDEF) (E F) > (BC D) (AEF) Liebe dbesse uss + ~ Py >P, +P, Py > P3 > Py > Py Py > Py > Py > Py > Py > P3 = (ABC) (DEF) = (AF) (B) (C) (0) (E) = (A) (BE) (C) (0) (F) > Py > Py = (AE) (C D) (B) (F) = (AF) (BC) (D) (E) = (AEF) (BCD)ga fa. (AB) > (CD) > >P; = (AB)(CD) (AC) > ¥ > +P, = (AC) (B) (D) (AD) > (BC) > (ABD) 7 o> Py (BC) > (ABD) 3 >Pn (B D) > (AB) 3 Py (C D) > (AB) 3 PY There are no new terms produced by the sums. 1b. Same as 2a. te. and 1d. (A B) > (C D) > +P, = (AB) (CD) (E) (AC) (AB)(CE) > (CD) > > Py (AD) > (CE) (AB)(DE) > >Py (AE) > (CD) > (AB) ~ >P, = (ABE) (CD) (BC) + (DE) > +P, = (A) (BC) (DE) (BD) > (AB) (DE) > Py (BE) (AB) > (AE) 7 >P, (C D) > (AB) > Py (CE) > (DE) (AB) > > P, = (AB) (CDE) (DE)>V > > Ps = (A) (B) (C) (DE) There are no new terms produced by the sums. te. (AB) > (CE) (BD) > (AD) > > P, = (ABD) (CE) (F) (AC) > (BF) > -P2 = (AC) (BF) (0) (E) (AD) > (AB) > Py (AE) > (CE) (BF) + +P3 = (ACE) (BF) (D) (AF) > (AE) (BD) 7 Py (BC) + (CE) (DF) > (ADE) 3 PN (BD) > (CE) (AD) 2 Py (BE) > (DF) (ADE) > Py (BF) > (AC) > > P2 (CD) + (AF) 3 Py(CE) ov (CF) > (AE) (DF) (DE) > (CE) (AF) (DF) > (ADE) (EF) > (AC) (DF) bead + Py > Py > Py > Py > Py Po + P, = Ps = (ACE) (BF) (D} ane (AB) > (BDF) (AC) > (ABD) (AD) > (BCE) (AE) > (BEF) (AF) > (ABE) (BC) + (AD F) (BD) > (CF) (DE) (BE) > (DE) > (CF) (BF) > (AD) (EF) (C D) > (AE) (C E) > (AE) (OF) (CF) > (DE) (DE) > (CF) (DF) > (ACE) (EF) > (AE) HLlhtbbbybudydusysye > Px > Px > Py > Py > Py Py >P, Py > Py > Py > Py Pp +P, Py Py There are no new terms produced by the sums. 1g. (AB) > (C E) (BD) 3 (CDF) (AC) > (8D) (CF) (AD) > (CE) 9 (CDF) (AE) > (BF) (AF) > (AC) (BD) (BC) 3 (EF) 3 (AC) (OF) (BD) 34 (BE) > (AE) > (BF) blbtusiua > Py Py > Py > Pp Py > Py > Ps > Py 0 (A) (8) (C E) (D) (F) (A) (BD E) (CF) (A) (B) C F) (DE) (AC F) (BD) (E) (A E) (BF) (C) (D) (A) (B D) (C) (E) (F)(BF) > (AE) > Pe (C D) > (BD) (E F) > Py (CE) + (CDEF) > Py (C F) > (AF) > (BD) edema ae (DE) > (CE) (BF) > Py (O F) > (BD) (AE) 3 +P, = (AE) (BDF) (C) (EF) > (AC) (DF) 3 Py There are no new terms produced by the sums. th. (AB) > (DE) (8G) > (CD) (AC) > (BG) (DF) (AD) > (AB) (CD) (AE) ov (AF) > (BG) > (AE) (AG) > (ABD) (BC) > (EF G) + (ABDG) (BD) > (AE) (CG) > (AG) (BF) (BE) > (0G) 5 (80) (BF) > (AE) (8G) > (ABDG) (BG) > (AE) (CD) (AG) (CF) (CE) > (6G) (OF) (CF) > (DF) 3 (AG) (CG) > (AG) (BF) (DE) > (AB) (CD) (DF) > (AG) (CD) (0G) (8C) (EF) > (BG) > (AE) (EG) > (ABD) Py (F G) > (AG) (BD) > Py There are no new terms produced by the sums. > Py Py > Py > P, 3 P, + Py > Px > Py > Px > Py > Ps = (AE) (BG) (C) (0) F) > Py > Py Py > Py +> Py Py > Py Pp (A E) (B) (C) (D) (F) (G) (AE F) (B G) (C) (D) ou eyli. (AB) > (BCE) (AC) > (BDE) > (ACF) (AD) > (EF) (AE) > (BF) > (CDF) (AF) > (DE) (BF) (BC) > (CDE) (BD) > (BCF) (BE) + (ACF) (BF) > (CDF) (C D) > (BE) (DF) (CE) > (AD) (EF) (CF) > (EF) > (AD) (DE) > (ABF) (OF) > BF) (EF) > (AD) Lllbbb bb bbybuvgs > Py > Py Py > Py Py Py Py Py > Py > Py Pp > P2 > Py > Py Py There are no new terms produced by the sums. 4}. (AB) > (EG) > (CG) (BD) (AC) > (AB) (FG) (AD) > (8G) > (AG) (BE) (AE) 3(8C) (0G) (AF) > (0) (AG) > (8G) > (BE) + (AC) (DE) (BC) > (EF) (BD) > (AG) (BE) (BE) > (AC) (DE) (BF) > (AB) (DE) (B G) > (AG) (BE) (CD) + (AG) (BF) (C E) > (AC) (DF) (CF) > (AG) (BF) (CG) > (AG) (BF) bhbbbbbbdebouvare > Py Py > Py oP, Pp > Py =P; > Py > Px > Py > Py > Py > Px > Py > Py = (AD) (E F) (B) (C) = (AD) (8) (CEF) = (AEF) (BC) (DG) = (AF) (B) (C) (D G) (E) = (A) (B.C) (D) (E F) (G)(DE) +(BDG) 3 Pn (DF) >(BDG) 3 Px (DG)> Vv > > Pa = (A) (B) (C) (D G) (E) (F) (EF) 3 (BC) 3 >P, (E G) > (CG) (BD) 3 Py (FG) > (BDG) 3 Py P, = Py + P, = (A) (BC) (DG) (EF) 2a. i. Py is output consistent; the table reduces to q q* z x=0 xed A B 0 B D A 1 A B 1 ii. No output consistent partitions; cannot be reduced. iii, P3 is output consistent; the table reduces to o rad ooo °2b eee P, is output consistent; the table reduces to q Zz x=1 A A B 0 B A 1 No output consistent partitions; cannot be reduced. P, is output consistent; the table reduces to B2d. i. Saeeeeeeee P, is output consistent; the table reduces to q q z x=0 xed A D 1 B A B oO A D 1 No output consistent partitions; cannot be reduced. No output consistent partitions; cannot be reduced.P, is output consistent; the table reduces to q q* Zz 1 x=0 xe A A B 1 B 8 c 0 c D c 1 D c c 1 P, is output consistent; the table reduces to q Zz m A D A 0 D A A 7 q qe z mooap,r wnoom> ~cocoos2f. i, P4 is output consistent; the table reduces to q 7 z x=1 A c B 0 B F Cc 1 c A c 0 F c c 1 ii. No output consistent partitions; cannot be reduced. iii. No output consistent partitions; cannot be reduced. iv. P, is output consistent; the table reduces to 5. a. The solution in the text is incorrect for Dg; the equations for D, and Dp should read Dy =x Dg = a’ That solution requires 5 gates with 12 inputs (plus the NOT). Two additional partitions to use for q3 are i. Py = (ABDE)(CF) ii. Py = (ADE) (BCF)The equations for D, and Dz are unchanged since they correspond to SP partitions: i. Dg = XQ; G2 Qa) + {x' Go's or x Gy’ Qa} Z= 4 + % li, Dg = xqg' + G2' Qs z= q + 2'G Each of these require 4 gates, with the first requiring 11 inputs and the second only 8. b. i a % [a % a fi | a a Alo o 0 0 0 0 0 0 Oo B 1 1 0 1 1 1 1 1 1 clo o 14 _ oo 14 ono} 1 0 4 1 0 1 1 0 0 E 1 = 7 1 1 0 1 1 0 i. x xq xq NEM ot 11 10 W150 01 11 10g Sy. 130 01 11 10 9213 9233 9233 00 x|x — =——Ce x] x] 1 01 1 01 + {| 01 1 a x x 11 |X 1|X 11 xX} 4 1 xX _ x to{x ]4 x | 10 t]a] x Ce z 20Dy = xq + xq," D. =x a Dg = xqy'+ x qo! + X G2 G5 Z= a2 + Ky + X as" This uses 8 gates with 19 inputs (plus the NOT). {as in the text assignment) Yea, way Ne, JO 01 11 «1 00 01 11 #10 1 140 1 4293 °° 4,93 : aa % © : 00 x| Xx oo} 1} X}x}4 00 x} x}4 01 1 o1 1 1 o1 1 1 — + 11] X]4 x 11 |X x 41 {X]1[1]X 10 | X11 x wolX]}1]1]X wo; X] tf 1x De Ca Dy = x'qy + xq," (as in the text assignment) D, = x' a, Dg =Qq3' + XQ; Q)' + xq,’ Z= +x q+ xQs" This uses 7 gates with 17 inputs (plus the NOT). iii. Nea, vay Ne 0 01 11 10 00 01 11 10 Gl a a) 4,93 443 49 00 00 }1 1 00 1 1 01 o1 X|X 01 xX| xX as] xfa x [x] xf a to | x]4 x to[x]r]i [x] 10 a}a |x De =)Dz, = xa Dg =x’ qo’ + a2 Gs" D, = xq, + xq, Z= q+ XG) + Gy Qs! This uses 8 gates with 17 inputs (plus the NOT). (as in the text assignment) 6. a First, we will find all of the SP partitions. (AB) > (BCD) (AC) > (BDE) (AD) > ¥ (AE) > (BCD) (BC) > (CE) (BD) > (AC) (BE)3V (CD) > (AE) (BD) (CE)>V (DE) > (AC) (BD) P2 + Py = Pe P, Py + Py P + Ps LHlidudsuse + > Py >Py > Pp = Py > Ps; Py a> P, > Py > Ps Py (AD) (BCE) (A D) (BE) (C) P, = (AD) (B) (CE) 0 (AC) (BDE) (A D) (B) (C) (E) = (A) (BCE) (D) = (A) (BE) (C) (0) = (A) (B) (CE) (0) No additional terms can be formed. None of these are output consistent. A good choice would be to use P,;, Pz, and the output consistent partition, giving the assignment 22First, we will construct next block tables for q, and qo. a a * 7 a” x=0 x= | x=0 x=1 0 1 1 o | o 1 1 Om 1 1 1 0 jon Ky=x dp =X Kp ax Also, z = qs’, since we used the output consistent partition. The map for q3*, with the D portion shaded for the quick method is ea, 4,93 00 o1 00 01 «11 «10 Js = XQ + XG "4 Ky = x + ay! 10 If we use the first five binary numbers to assign the states, we get the following equations: Jy = Ge a3! Kp =x Jp mee kK, =1 Jo = ay'@' Ky = x + Qe! Z = G4" a2! + ay! Gs! This solution requires only one extra gate. 23b. The SP partitions (found in Solved Problem 2d) are P, = (ABEG) (CDF) P2 = (AE G) (B) (C) (DF) Pg = (AG) (B) (C) (D F) (E) P, = (AEG) (BC) (DF) There is only one SP partition, P;. For a second, we will use the groupings of P3 for the second flip flop: P; = (ADF G) (BCE) Finally, we will use the second output column for the third flip flop, P, = (ADE) (BCFG) The resulting equations are Jp =x’ Jo = xa Jy = X2'+ Xa Z = XG + Gl dg + XO This requires 11 gates with 23 inputs (plus the NOT gate). The solution using the first 7 binary numbers (in order) produces Jy = Xp! + x! dg Ky = x24 xq3 de = x Gy + G1 G3" ee ea) jg =x Ky = x + Qi’ ae! Z =X Qe'+ Xo qo'+ Ge'da + (X'qy OF Gy Ge} requiring 17 gates with 38 inputs. 24c. This should refer to the state table of Exercise 3e. The only two-block SP partition is P, = (ABC) (DEF) It can be used for the first variable. If we use the output consistent partition, Po, = (ADE) (BCF), forgs, we need another partition that separated D from E, and B from C. Using Pz, we should keep A and F together. Two such assignments are For the first assignment, the equations are Jy =x K,=1 Je = XG) 43 + XGi' qs! Ke = x dg = X'+Qy'+q2 Kg = x Z= qs using 4 gates with 11 inputs. For the second assignment, the equations are Jy =x Ket Jo = XQ) Q3' + XG1' 3 Ky = xq Jg = xX +q2' K3 = x’ Z = Q3' using 5 gates with 12 inputs. 25Using the first 6 binary numbers, the solution 20 inputs. Jy = Xap! Jo = Xai Qo! + x G1" as Js = x'+q;'Q2' Z = qq 7. First, we need to find all of the (AB) > (C E) (BD) > (AD) (AC) > (BF) (AD) > (AB) (AE) > (CE) (BF) (AF) - (C E) (BD) > (AD) (BC) > (CE) (DF) > (AD) (BD) > (C E) (AD) (BE) > (DF) > (CE) (AD) (FV (CD) > (AF) (CE) av (CF) > (CE) (DF) (DE) > (CE) (AF) (DF) > (AD) (CE) (EF) >(0F) Ky =1 Ka = xq Ky = x Lllb bb bbbbusydsus +4) > Py > Py =P > Ps > Py > Py =P, > Py > Ps > Py > Pe > Py > Py > Py > Py Ps + Pe = Py = (A) (BF) (CE) (D) SP partitions. " " requires 9 gates with (AB D) (C E) (F) (AC) (B F) (D) (E) (AC E) (BF) (D) (ABDF) (CE) (A) (B F) (C) (0) (E) (A) (B) (C E) (D) (F) For output column z,, there are no output consistent SP partitions. We can use P, for one of the variables and P, = (ABE) (CD F) for the third variable. Their product is (A B) (C) (D F) (E). Ps would suggest using (AC D E) (BF) for qa, since it groups alll of these but D (and D cannot be grouped with F. This results in the following state asssignment: 26and produces the equations D, =x Dz = xq) + Xqo' Qs’ Dg =a) + Xq + XQ3 z= 4 which require 6 gates and 14 inputs. For Zp, P, is output consistent; the system can be reduced to one with two states. q : xed A Cc A 0 Cc c A 1 For this, D = x and z = q. For zs, only Pg is output consistent. Thus, the system can be reduced to one with 5 states. 27q > x=0 A c B 1 B c D 0 Cc c F oO D c A 0 F c D 1 | Those partitions greater than Pg are SP, namely Py” = (ABD) (C) (F) Ps" = (AE) (BF) (D) P,* = (ABDF)(C) P7* = (A) (BF) (C) (0) u We still need three flip flops. We can use P,* for q; and the output consistent partition, Pog = (AF) (BC D) for q. Then we can use (A.B C) (D E) for gg, giving the state assignment Qa] % % 4% A oO 0 0 B 0 O 1 c 1 O 1 D 0 1 1 F O 1 O The resulting equations are D, = x Gi + XQ2' ds + Xd2 Qs" + {Qy' Qs! + 2'Qg_ OF Gy Gg’ + Gy! Qe’ OF Gy’ Qe! + Ga! Ga'} 28