THE ISLAMIC UNIVERSITY OF GAZA

ENGINEERING FACULTY

DEPARTMENT OF COMPUTER ENGINEERING

DIGITAL LOGIC DESIGN DISCUSSION – ECOM 2012

Eng. Huda M. Dawoud

October, 2015
DIGITAL LOGIC DESIGN ECOM 2012 ENG. HUDA M. DAWOUD

2.2 Simplify the following Boolean expressions to a minimum number of

literals:

(a) xy + xy’ (b) (x + y) (x + y’)

(f) a’bc + abc’ + abc + a’bc’

Answer:

a) xy + xy’= x(y + y’) = x(1) = x

b) (x + y)(x + y') = xxx + xy’ + xy + yy'0 = x + x(y+y’)1 + 0 = x

f) a’b(c+c’) 1+ ab(c+c’)1 = b(a’+a)1 = b

2.3 Simplify the following Boolean expressions to a minimum number of

literals:

(b) x'yz + xz (d) xy + x(wz + wz’)

Answer:

b) x'yz + xz = (x'y + x)z = z(x + x')1(x + y) = z(x + y)

2
DIGITAL LOGIC DESIGN ECOM 2012 ENG. HUDA M. DAWOUD

d) xy + x(wz + wz') = x(y +wz + wz') = x(y + w(z+z’)) = x(w + y)

2.4 Reduce the following Boolean expressions to the indicated number of

literals:

(a) A’C’ + ABC + AC’ to three literals

(b) (x’y’ + z)’ + z + xy + wz to three literals

(c) A’B(D’ + C’D) + B(A + A’CD) to one literal

Answer:

a) A'C' + ABC + AC' = C'(A’+A)1 + ABC = (C’ + AB)(C’ + C)1= C' + AB

b) (x'y' + z)' + z + xy + wz = (x'y')'z' + z + xy + wz

=[ (x + y)z' + z] + xy + wz = (z + z')(z + x + y) + xy + wz
= z + wz + x + xy + y = z(1 + w) + x(1 + y) + y = x + y + z

(c) A'B(D' + C'D) + B(A + A'CD) = B(A'D' + A'C'D + A + A'CD)

= B(A'D' + A + A'D(C + C') = B(A + A'(D' + D)) = B(A + A') = B

2.5 Draw logic diagrams of the circuits that implement the original and
simplified expressions in Problem 2.2.

Answer:

a)

3
DIGITAL LOGIC DESIGN ECOM 2012 ENG. HUDA M. DAWOUD

b)

2.8 Find the complement of F = wx + yz; then show that FF’ = 0 and F + F’ = 1.

Answer:

F' = (wx + yz)' = (wx)'(yz)' = (w' + x')(y' + z')

FF' = wx(w' + x')(y' + z') + yz(w' + x')(y' + z') = 0

F + F' = wx + yz + (wx + yz)' = A + A' = 1 with A = wx + yz

2.9 Given the Boolean functions F1 and F2, show that

(a) The Boolean function E = F1 + F2 contains the sum of the minterms of F1

and F2.

(b) The Boolean function G = F1F2 contains only the minterms that are
common to F1 and F2.

Answer:

(a) F1 + F2 = ∑ m1i + ∑m2i= ∑ (m1i + m2i)

(b) F1 F2 = ∑ mi ∑ mj where mi mj = 0 if i ≠ j and mi mj = 1 if i = j

4
DIGITAL LOGIC DESIGN ECOM 2012 ENG. HUDA M. DAWOUD

2.12 We can perform logical operations on strings of bits by considering

each pair of corresponding bits separately (called bitwise operation). Given
two eight‐bit strings A = 10110001 and B = 10101100, evaluate the eight‐bit
result after the following logical operations:

(a) AND (b) OR (c) XOR (d) NOT A (e) NOT B

Answer:

a) 1010 0000

b) 1011 1101

c) 0001 1101

d) 0100 1110

e) 0101 0011

2.13 Draw logic diagrams to implement the following Boolean expressions:

(a) F = [(u + x’) (y’ + z)]

Answer:

a)

5
DIGITAL LOGIC DESIGN ECOM 2012 ENG. HUDA M. DAWOUD

2.14 Implement the Boolean function

F = xy + x’y’ + y’z

(a) With AND, OR, and inverter gates

(b) With OR and inverter gates

(c) With AND and inverter gates

(d) With NAND and inverter gates

(e) With NOR and inverter gates

Answer:

a)

b)

6
DIGITAL LOGIC DESIGN ECOM 2012 ENG. HUDA M. DAWOUD

c)

d)

e)

7
DIGITAL LOGIC DESIGN ECOM 2012 ENG. HUDA M. DAWOUD

2.15 Simplify the following Boolean functions T1 and T2 to a minimum

number of literals:

Answer:

T1 = A’B’C’ + A’B’C + A’BC’ = A’B’(C’ +C)1 + A’BC’ = A’B’ + A’BC’

= (A’B’ + A’B) (A’B’ + C’) = A’(B’+B)1(A’B’ + C’) = A’(A’B’ + C’)
= (A’A’B’ + A’C’) = (A’B’ + A’C’) = A’(B’ + C’)

T2 = (A + B + C)(A + B + C’)(A + B’ + C)
= (A + AB + AC’ + AB + B + BC’ + AC + BC + CC’)(A + B’ + C)
= (A(1+B+C’+C)1 + B(1+C’+C)1 + CC’0)(A + B’ + C)
= (A + B)(A + B’ + C) = A + AB’ + AC + AB + BB’0 + BC = A(1+B’+C+B) + BC
= A + BC

OR

T2 =T1' = A'BC + AB'C' + AB'C + ABC' + ABC

= BC(A' + A) + AB'(C' + C) + AB(C' + C)
= BC + AB' + AB = BC + A(B' + B)
= A + BC

8
DIGITAL LOGIC DESIGN ECOM 2012 ENG. HUDA M. DAWOUD

2.16 The logical sum of all minterms of a Boolean function of n variables is 1.

(a) Prove the previous statement for n = 3.

(b) Suggest a procedure for a general proof.

Answer:

a) F(A, B, C) = A'B'C' + A'B'C + A'BC' + A'BC + AB'C' + AB'C + ABC' + ABC

= A'(B'C' + B'C + BC' + BC) + A((B'C' + B'C + BC' + BC)
= (A' + A)(B'C' + B'C + BC' + BC) = B'C' + B'C + BC' + BC
= B'(C' + C) + B(C' + C) = B' + B = 1

b) F(x1, x2, x3, ..., xn) = ∑mi has 2n/2 minterms with x1 and 2n/2 minterms
with x'1, which can be factored and removed as in (a). The remaining 2n-
1 product terms will have 2n-1/2 minterms with x2 and 2n-1/2 minterms
with x'2, which and be factored to remove x2 and x'2, continue this
process until the last term is left and xn + x'n = 1.

2.17 Obtain the truth table of the following function, and express the
function in sum‐of‐minterms and product‐of‐maxterms form:

(b) (cd + b’c + bd’)(b + d)

Answer:

(cd + b’c + bd’)(b + d) = bcd + bb’c0 + bbd’ + cdd + b’cd + bdd’0

= bcd + bd’ + cd + b’cd b c d F
= bcd + b(c+c’)d’ + (b+b’)cd + b’cd 0 0 0 0
= bcd + bcd’ + bc’d’ + bcd + b’cd + b’cd 0 0 1 0
0 1 0 0
F = ∑(0,1,2,5) =П(3,4,6,7)
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 1

9
DIGITAL LOGIC DESIGN ECOM 2012 ENG. HUDA M. DAWOUD

2.19 Express the following function as a sum of minterms and as a product of

maxterms:

F(A, B, C, D) = B’D + A’D + BD

Answer:

 First look at the number of literals… we have four different literals

A,B,C,D
 In the first term B’D, we have A,C are missing
 We get them back as (A+A’)B’(C+C’)D, that B’D is equivalent to
AB’CD + A’B’CD + AB’C’D + A’B’C’D and so on…

F = (A+A’)B’(C+C’)D + A’(B+B’)(C+C’)D + (A+A’)B(C+C’)D

= AB’CD + A’B’CD + AB’C’D + A’B’C’D + A’BCD + A’B’CD + A’BC’D +
A’B’C’D + ABCD + A’BCD + ABC’D + A’BC’D (omit repeted terms)
= AB’CD + A’B’CD + AB’C’D + A’B’C’D + A’BCD + A’BC’D + ABCD + ABC’D
= ∑(11, 3, 9, 1, 7, 5, 15, 13) = ∑(1, 3, 5, 7, 9, 11,13, 15)
= П (0, 2, 4, 6, 8, 10, 12, 14)

2.20 Express the complement of the following functions in sum‐of‐minterms

form:

(a) F(A,B ,C, D) = ∑(2, 4, 7, 10, 12, 14)

(b) F ( x, y, z ) = П(3, 5, 7)

Answer:

a) ∑(0, 1, 3, 5, 6, 8, 9, 11, 13, 15)

b) П(3, 5, 7) = ∑(3, 5, 7)

2.21 Convert each of the following to the other canonical form:

(a) F(x, y, z) = ∑(1, 3, 5)

10
DIGITAL LOGIC DESIGN ECOM 2012 ENG. HUDA M. DAWOUD

(b) F(A, B, C, D) = П(3, 5, 8, 11)

Answer:

a) П(0, 2, 4, 6, 7)

b) ∑(0, 1, 2, 4, 6, 7, 9, 10, 12, 13, 14, 15)

2.24 Show that the dual of the exclusive‐OR is equal to its complement.

Answer:

x ⊕ y = x'y + xy' and (x ⊕ y)' = (x + y')(x' + y)

Dual of x'y + xy' = (x' + y)(x + y') = (x ⊕ y)'

2.29 Determine whether the following Boolean equation is true or false.

x’y’ + x’z + x’z’ = x’z’ + y’z’ + x’z

Answer:

False

x’y’ + x’z + x’z’ ≠ x’z’ + y’z’ + x’z

∑(0,1,2,3) ≠ ∑(0,1,2,3,4)

11