Simplify the Karnaugh map using maxterms in Figure 1 to create a Boolean express

Question

Simplify the Karnaugh map using maxterms in Figure 1 to create a Boolean expression Draw the circiut for the simplified expression using AND, OR and NOT gates. Figure 1 A device generates two different types of sounds based on the input button press. It has 4 buttons A, B, C and D. It generates a mocking bird sound when either when button C pressed or any 2 other buttons are pressed. It generates wood-pecker sound for any other combination of button press. You need to design a circuit to set F to high when mocking bird sound is produced and to low when-pecker sound is produced. You should come up with a circuit which uses minimum number of gates. Compete the Truth table and draw the Karnaugh map. Using K-map find the minimum Boolean expression for the output. Implement the function using as few AND, OR and NOT gates as possible.

Explanation / Answer

please rate - thanks

CRAMSTER rule-1 question per post, this is 2

F=AB'+CD+B'D

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---