The Student Room Group
Uni students - Complete our survey >>
Uni students - Complete our survey >>
Uni students - Complete our survey >>

This discussion is now closed.

Check out other Related discussions

karnaugh maps and boolean expressions

Anyone know anything about this stuff?

I have a karnaugh map like this:

And as far as I can see, the karnaugh map is going to have be massive, like "NOT(A1.A0.B1.B0) OR (A1.A0.B1.B0) OR..." and so forth. Am I completely wrong?
Can you post the truth table you were originally asked to simplify?
Reply 2
Avatar for lagoyu
lagoyu
It's been a long time but I hope this is right.

Remembering that you can wrap around the edges of Karnaugh maps, you can make four overlapping groups of four zeros. Using + for OR the results can be written as:

NOT( (NOT(A1).B1) + (A1.NOT(B1)) + (NOT(A0).B0) + (A0.NOT(B0)) )

Then you can then apply De Morgan's theorem to produce

(A1+NOT(B1)).(NOT(A1)+B1).(A0+NOT(B0)).(NOT(A0)+B0)

Apply DM to the individual bracketed expressions again to help with NAND gate implementation

Related discussions

Latest

Trending

Trending

Articles for you