vault backup: 2025-02-24 11:08:29

education/computer engineering/ECE2700/Karnaugh Maps.md

@@ -23,4 +23,14 @@ To convert a 3 variable Karnaugh map to a minimal boolean expression, start by l
 
 ![[Pasted image 20250224110124.png]]
 
-From there, describe the pair of 1s using boolean a
+From there, describe the pair of 1s using boolean algebra.
+
+In the above example, the top pair of 1s is in the column where $x_3$ is equal to zero ($\overline{x_3}$), and $x_1$ is equal to $1$ ($x_1$). This describes a single term in the resulting equation ($x_1\overline{x_3}$).
+
+
+![[Pasted image 20250224110632.png]]
+> Similar logic can be employed using more than just a *pair* of ones.
+
+
+# Four Variable Maps
+![[Pasted image 20250224110819.png]]