Find Min AND-OR Expression in K-Map w/Don't Cares

  • Thread starter Thread starter ibcoding
  • Start date Start date
AI Thread Summary
The discussion focuses on finding the minimum AND-OR expression using a Karnaugh map (K-map) that includes Don't Cares. The proposed expression is b'd' + b'c + ac, which the poster initially questions but later confirms as correct. However, a participant points out the lack of variable labeling on the K-map, making it difficult to verify the accuracy of the expression. The conversation highlights the importance of clear labeling in K-map analysis for accurate results. Overall, the thread emphasizes the process of simplifying Boolean expressions using K-maps with Don't Cares.
ibcoding
Messages
11
Reaction score
0
I am trying to find the minimum AND-OR expression in a K-map with Don't Cares. My Karnaugh map is attached below.

Here is the min AND-OR expression, I believe.b'd' + b'c + ac

 

Attachments

  • K-Map.png
    K-Map.png
    2.6 KB · Views: 519
Physics news on Phys.org
For a little more clarity: E(0,3,14) + d(2,4,7,8,10,11,13,15)
 
Nevermind...it's right. Sorry to post prematurely
 
ibcoding said:
I am trying to find the minimum AND-OR expression in a K-map with Don't Cares. My Karnaugh map is attached below.

Here is the min AND-OR expression, I believe.


b'd' + b'c + ac


Since you didn't show your variables a,b,c,d on the K map, it's hard to verify your expression, although I do get a similar form with 3 groups on the K map each including 4 squares.
 
Back
Top