Are we supposed to memorize Karnaugh maps?

  • Thread starter Thread starter tamtam402
  • Start date Start date
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
5 replies · 2K views
tamtam402
Messages
199
Reaction score
0
Hey guys, my professor briefly introduced Karnaugh maps and I was wondering if I'm supposed to memorize which areas correspond to which inputs (bits). Is there a trick to rebuild Karnaugh maps from memory? Just to be clear, I know how to use them to find a minimal sum of products, I'm talking about the maps "frames".
 
Engineering news on Phys.org
No. Each map is unique to the problem at hand. Memorize the reductions.
 
I'm not talking about the filled map, I'm talking about the "shell". For example, a 3 inputs map can always be drawn this way:

0 Y XY X
Z YZ XYZ XZThen, if I were asked to write an expression for F = ƩX,Y,Z(0,2,7), the filled map would look like this:

0 = 000, 2 = 010 and 7 = 111. Which means:

1 1 0 0
0 0 1 0EDIT: you were referencing to the 2nd part of the problem. I know the filled map is unique. I'm asking about the shell of the map, which will always have the same possible forms for a X inputs. Obviously the possible forms are easy to find for a 3 input map, but you should understand what I'm talking about.
 
tamtam402 said:
I'm not talking about the filled map, I'm talking about the "shell". For example, a 3 inputs map can always be drawn this way:

0 Y XY X
Z YZ XYZ XZ


Then, if I were asked to write an expression for F = ƩX,Y,Z(0,2,7), the filled map would look like this:

0 = 000, 2 = 010 and 7 = 111. Which means:

1 1 0 0
0 0 1 0


EDIT: you were referencing to the 2nd part of the problem. I know the filled map is unique. I'm asking about the shell of the map, which will always have the same possible forms for a X inputs. Obviously the possible forms are easy to find for a 3 input map, but you should understand what I'm talking about.

I think you should memorize the order of the bits for 2, 3, and 4 variable karnaugh maps . . its just remembering that one of the bit orders is flipped with 3 and 4 variables. That way you can set up your maps for those cases. This will cover you in an exam, but the professor might even be nice and write out the empty map for you. But you don't need to memorize this later in life if that's what you're asking.
 
It is utterly irrelevant what order you use to lay out the variables in a K-map. As long as you are consistent between what you draw and how you interpret it, you'll get the exact same answer regardless of the order of the variables.

If your prof wants you to stick to some specific layout, he is being WAY overly anal about it.
 
As you come along in your studies...solving the maps will be the easy part.

Setting up the maps from a tricky circuit will be the bigger challenge eventually.