Scribd
Upload
95 views1 page

Digital Design Exercise Kmap3

1) Design a minimum-cost SOP circuit that implements a majority function of 4 variables, where the output is 1 if any 3 or all 4 inputs are 1. 2) Derive a minimum-cost realization of a 4-variable function that is 1 if exactly 2 or exactly 3 inputs are 1, and 0 otherwise. 3) Design a minimum-cost circuit that implements two separate output functions f and g using K-maps, considering don't care conditions.

Uploaded by

jdebnath
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
95 views1 page

Digital Design Exercise Kmap3

1) Design a minimum-cost SOP circuit that implements a majority function of 4 variables, where the output is 1 if any 3 or all 4 inputs are 1. 2) Derive a minimum-cost realization of a 4-variable function that is 1 if exactly 2 or exactly 3 inputs are 1, and 0 otherwise. 3) Design a minimum-cost circuit that implements two separate output functions f and g using K-maps, considering don't care conditions.

Uploaded by

jdebnath
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

Practice Exercise # 4

1. A four-variable logic function that is equal to 1 if any three or all four of its variables are equal to 1 is
called a majority function. Design a minimum-cost SOP-circuit that implements this majority function.
(you may consider using K-map)

2. Derive a minimum-cost realization of the four-variable function that is equal to 1 if exactly two or
exactly three of its variables are equal to 1; otherwise it is equal to 0. (you may consider using K-map)

3. A circuit with two outputs has to implement the following functions:

Design the minimum-cost circuit that implement f and g separately. (you may consider using K-map,
remember here D stands for Don’t care conditions!!).

4.

5. Derive the simplest Boolean expressions for the circuit shown in the following Figure using i) NAND
and ii) NOR gates only.

6. Find the minimum-cost SOP and POS forms for the following functions:
i) 𝑓(𝑥1 , … , 𝑥4 ) = ∑ m(0, 2, 8, 9, 10, 15) + D(1, 3, 6, 7)
ii) 𝑓(𝑥1 , 𝑥2 , 𝑥3 ) = ∑ m(1, 4, 7) + D(2, 5)

You might also like