Electrical Engineering › Section S · Logic gates and Boolean algebra › Topic S.5

Karnaugh maps, Quine-McCluskey, and VHDL

Algebraic simplification depends on spotting the right steps; a Karnaugh map makes them visible, so the simplest sum-of-products or product-of-sums form can be read off a grid. This topic covers maps of up to four variables, don't-care conditions, the Quine-McCluskey method that computers use instead, and how a simplified expression is written in VHDL.

In this topic

  • A map that shows adjacency
  • Three- and four-variable maps
  • Grouping rules
  • Worked example: corners and centre
  • Don't-care conditions
  • Worked example: a BCD digit of 5 or more
  • Minimising in POS form
  • Beyond four variables: Quine-McCluskey
  • Worked example: Quine-McCluskey
  • Boolean expressions in VHDL
  • Common mistakes to avoid
  • Key takeaways

This topic is part of Wuanberri Pro. Checking your access…

← Previous topicNext topic →