Scribd
Upload
65 views

Homework 5

1. The document provides examples of simplifying Boolean functions down to their simplest forms using Sum of Products and Product of Sums. This includes implementing the simplified forms using NAND and NOR gates. 2. Methods shown include using K-maps to minimize expressions, distributing terms, taking complements, and applying DeMorgan's theorems. 3. Examples are given of implementing simplified Boolean expressions using multiple logic gate levels including NAND-AND, AND-NOR, OR-NAND and NOR-OR configurations.

Uploaded by

Kateryna Ternova
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
65 views

Homework 5

1. The document provides examples of simplifying Boolean functions down to their simplest forms using Sum of Products and Product of Sums. This includes implementing the simplified forms using NAND and NOR gates. 2. Methods shown include using K-maps to minimize expressions, distributing terms, taking complements, and applying DeMorgan's theorems. 3. Examples are given of implementing simplified Boolean expressions using multiple logic gate levels including NAND-AND, AND-NOR, OR-NAND and NOR-OR configurations.

Uploaded by

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

1) Simplify the following functions, and implement them with two-level NAND gate circuits:

(a) F(A, B, C, D) = AC’D’ + A’C + ABC + AB’C + A’C’D’

cd

ab 00 01 11 10

00 1 0 1 1

01 1 0 1 1

11 1 0 1 1

10 1 0 1 1
F(A, B, C, D) = D’+C

(b) F(A, B, C, D) = A’B’C’D + CD + AC’D

cd

ab 00 01 11 10

00 0 1 1 0

01 0 0 1 0

11 0 1 1 0

10 0 1 1 0
F(A, B, C, D) = B’D+AD+CD

2. Simplify the following functions, and implement them with two-level NOR gate circuits:

(a) F = wx’ + y’z’ + w’yz’

yz

wx 00 01 11 10

00 1 0 0 1

01 1 0 0 1

11 1 0 0

10 1 1 1 1
F = (w+x+z’)(x’z’)
(b)F(w, x, y, z) = ∑(0, 3, 12, 15)

CD

AB 00 01 11 10

00 1 0 1 0

01 0 0 0 0

11 1 0 0 0

10 0 0 0 0
F(w, x, y, z) = (A +B’)(A’+B)(C+D’)(C’+D)(B’+C’) Product of Sum form from K-map

The function can be further reduced using through Boolean simplification.

FOIL to obtain Sum of Products

(A+B’)(A’+B)  A’B’+AB

(C+D’)(C+D)  C+CD’+CD  C

=(A’B’+AB)(C)(B’+C)
(C)(B’+C)  B’C + C  C

= C(A’B’ +AB)

Distribute the C  A’B’C + ABC

Take the complement to obtain Sum of Products form

 (A+B+C’)(A’+B’+C’)

(c)F (x, y, z) = [(x + y)(x’ + z)]’


FOIL the (x + y)(x’ + z)  (x’y+xz+yz)’
Take the complement to obtain Product of Sums form from DeMorgan’s Theorem 
= (x+y’)(x’+z’)(y’+z’)
3. Draw the multiple-level NOR circuit for the following expression
CD(B + C)A + (BC’+ DE’)
Distribute ACD(B+C)= ABCD+ACD
=ABCD+ACD +BC’+DE’
Take the complement to get Product of Sums form
(ABCD+ACD +BC’+DE’)’ = (A’+B’+C’+D’)(A’+C’+D’)(B’+C)(D’+E)
4. Draw the multiple-level NAND circuit for the following expression:
w(x + y + z)+ xyz
Distribute w(x + y + z)  wx + wy + wz
= wx + wy + wz + xyz

yz

wx 00 01 11 10

00 0 0 0 0

01 0 0 1 0

11 1 1 1 1

10 0 1 1 1
wx + wy + wz + xyz

5.
Implement the following Boolean function F, together with the don’t-care conditions d, using no
more than two NOR gates:

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


d(A, B, C, D)= ∑(0, 1, 5, 8)
Assume that both the normal and complement inputs are available.

CD

AB 00 01 11 10

00 X X 0 1

01 1 X 0 0

11 1 0 0 1

10 X 0 0 1

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


Distributing the D’  AD’+ B’D’
Take the complement to obtain Product of Sums form.
= (A’+D)(B+D)

Three gates are required to implement the function.


6. Implement the following Boolean function F, using the two-level forms of logic (a) NAND-
AND, (b) AND-NOR, (c) OR-NAND, and (d) NOR-OR

CD

AB 00 01 11 10

00 1 0 0 0

01 0 0 0 0

11 1 0 0 1

10 1 1 1 1

F= AB’+B’C’D’+AD’ =[(A’+B)(B+C+D)(A’+D)]’

(a) NAND-AND

(c) OR-NAND
(d) NOR-OR

7. With the use of maps, find the simplest sum-of-products form of the function F = fg, where
f = abc’+ c’d + a’cd’+b’cz’
g = (a + b + c’+d’)(b’+ c’+ d)(a’+ c + d’)
CD

AB 00 01 11 10

00

01

11

10

CD

AB 00 01 11 10

00

01

11

10

8.
Implement the following Boolean expression with exclusive-OR and AND gates:F =
AB’CD’+A’BCD’+ AB’C’D + A’BC’D
= AB’(CD’+C’D) + A’B(CD’+C’D)
=(CD’+C’D)(AB’+A’B)
=(C XOR D)( A XOR B)

You might also like