click below
click below
Normal Size Small Size show me how
boolean algebra
1.4 - data structures (boolean algebra, maps)
Term | Definition |
---|---|
why simplification is necessary | logic gates are the fundamental components of electrical circuits so simplifying them reduces costs/sizes |
karnaugh maps | a method of simplifying boolean expressions |
how to use a Karnaugh map | for each side of an OR GATE, consider the cases where it would be 1. If its a condition operator (NOT), consider that too |
simplifying using Karnaugh maps | considering the output and if that can be expressed with a shorter case for bigger maps, the boxes must be rectangular or square with only 1’s and as large as possible (min boxes), containing a power of two 1’s. They CAN overlap/wrap. |
multi-input Karnaugh maps | express the inputs in a way such that there is still only 1 row or column (e.g AB,C), ensuring that only 1 digit changes at a time (grey codes) |