| Karnaugh map technique steps |
|
➨
Boolean expression (not simplified) ➨ truth table ➨ Karnaugh map ➨ grouped Karnaugh map ➨ Boolean expression (simplified) |
| Karnaugh maps grouping rules |
|
groups should be:
• rectangular • made of 1, 2, 4, 8, 16, etc. cells • minimum in number • as big as possible in size (each) |
|
groups could be:
• overlapping one over another • crossing through boundaries (a la Pac-Man :-) |
Next: DeMorgan’s theorem