[go: up one dir, main page]
Scribd
Upload
50 views1 page

Assignment 5: Gate Level Minimization

This document provides instructions for an assignment on gate level minimization. It includes problems to simplify Boolean functions and expressions using maps with 3 and 4 variables. It also includes problems to find prime implicants, convert between sum of products and product of sums forms, and simplify with don't care conditions.

Uploaded by

aya
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
50 views1 page

Assignment 5: Gate Level Minimization

This document provides instructions for an assignment on gate level minimization. It includes problems to simplify Boolean functions and expressions using maps with 3 and 4 variables. It also includes problems to find prime implicants, convert between sum of products and product of sums forms, and simplify with don't care conditions.

Uploaded by

aya
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/ 1

Course: ECE 222 Digital Design Logic Lecturers: Hossam Shalaby

Semester: Fall 2019 Assistants: Mahmoud Khodier

Assignment 5: Gate Level Minimization

1) Simplify the following Boolean functions, using three-variable maps:


a. 𝑭(𝒙, 𝒚, 𝒛) = ∑(𝟎, 𝟐, 𝟒, 𝟓)
b. 𝑭(𝒙, 𝒚, 𝒛) = ∑(𝟎, 𝟐, 𝟒, 𝟓, 𝟔)
c. 𝑭(𝒙, 𝒚, 𝒛) = ∑(𝟏, 𝟐, 𝟑, 𝟕)
2) Simplify the following Boolean expressions, using three-variable maps:
a. 𝑭(𝒙, 𝒚, 𝒛) = 𝒙’ 𝒚’ + 𝒚𝒛 + 𝒙’𝒚𝒛’
b. 𝑭(𝒙, 𝒚, 𝒛) = 𝒙’𝒚 + 𝒚𝒛’ + 𝒚’𝒛’
c. 𝑭(𝒙, 𝒚, 𝒛) = 𝒙’𝒚𝒛 + 𝒙𝒚’𝒛’ + 𝒙𝒚’𝒛
3) Simplify the following Boolean functions, using four-variable maps:
a. 𝑭 (𝑨, 𝑩, 𝑪, 𝑫) = ∑(𝟏, 𝟒, 𝟓, 𝟔, 𝟏𝟐, 𝟏𝟒, 𝟏𝟓)
b. 𝑭 (𝑨, 𝑩, 𝑪, 𝑫) = ∑(𝟐, 𝟑, 𝟔, 𝟕, 𝟏𝟐, 𝟏𝟑, 𝟏𝟒)
c. 𝑭 (𝑨, 𝑩, 𝑪, 𝑫) = ∑(𝟏, 𝟑, 𝟒, 𝟓, 𝟔, 𝟕, 𝟗, 𝟏𝟏, 𝟏𝟑, 𝟏𝟓)
d. 𝑭 (𝑨, 𝑩, 𝑪, 𝑫) = ∑(𝟎, 𝟐, 𝟒, 𝟓, 𝟔, 𝟕, 𝟖, 𝟏𝟎, 𝟏𝟑, 𝟏𝟓)
4) Simplify the following Boolean expressions, using four-variable maps:
a. 𝒘’ 𝒛 + 𝒙𝒛 + 𝒙’ 𝒚 + 𝒘𝒙’ 𝒛
b. 𝑨𝑫’ + 𝑩’𝑪’𝑫 + 𝑩𝑪𝑫’ + 𝑩𝑪’𝑫
c. 𝑨𝑩’𝑪 + 𝑩’𝑪’𝑫’ + 𝑩𝑪𝑫 + 𝑨𝑪𝑫’ + 𝑨’𝑩’𝑪 + 𝑨’𝑩𝑪’𝑫
d. 𝒘𝒙𝒚 + 𝒙𝒛 + 𝒘𝒙’𝒛 + 𝒘’𝒙
5) Find all the prime implicants for the following Boolean functions, and determine which are essential:
a. 𝑭 (𝒘, 𝒙, 𝒚, 𝒛) = ∑(𝟎, 𝟐, 𝟒, 𝟓, 𝟔, 𝟕, 𝟖, 𝟏𝟎, 𝟏𝟑, 𝟏𝟓)
b. 𝑭 (𝑨, 𝑩, 𝑪, 𝑫) = ∑(𝟎, 𝟐, 𝟑, 𝟓, 𝟕, 𝟖, 𝟏𝟎, 𝟏𝟏, 𝟏𝟒, 𝟏𝟓)
c. 𝑭(𝒘, 𝒙, 𝒚, 𝒛) = ∑(𝟏, 𝟑, 𝟔, 𝟕, 𝟖, 𝟗, 𝟏𝟐, 𝟏𝟑, 𝟏𝟒, 𝟏𝟓)

6) Convert the following Boolean function from a sum-of-products form to a simplified product-of-sums form.
𝑭(𝑨, 𝑩, 𝑪, 𝑫) = ∑(𝟎, 𝟏, 𝟐, 𝟓, 𝟖, 𝟏𝟎, 𝟏𝟑)

7) Simplify the following expressions to (1) sum-of-products and (2) products-of-sums:


a. (𝑨’ + 𝑩 + 𝑫’)(𝑨’ + 𝑩’ + 𝑪’)(𝑨’ + 𝑩’ + 𝑪)(𝑩’ + 𝑪 + 𝑫’)
b. 𝑩𝑪𝑫’ + 𝑨𝑩𝑪’ + 𝑨𝑪𝑫

8) Simplify the following Boolean function F, together with the don’t-care conditions d. Express
the simplified function in sum-of-product form:
a. 𝐹(𝑥, 𝑦, 𝑧) = ∑(0,1,4,5,6) , 𝑑(𝑥, 𝑦, 𝑧) = ∑(2,3,7)
b. 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∑(4,5, 7, 12,13, 14) , 𝑑(𝐴, 𝐵, 𝐶, 𝐷) = ∑(9, 11, 15)
c. 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∑(1,3,8,10,15) , 𝑑(𝐴, 𝐵, 𝐶, 𝐷) = ∑(0,2, 9)

You might also like