arc/notes
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

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

Browse Source
This commit is contained in:
arc 2025-02-24 11:03:29 -07:00
parent 08d94b9a5a
commit e35525f967
2 changed files with 7 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
Pasted image 20250224110124.png Normal file
View File

Binary file not shown.
Side by Side

After

Width:  |  Height:  |  Size: 17 KiB

8
education/computer engineering/ECE2700/Karnaugh Maps.md
View File

@ -17,4 +17,10 @@ To find a minimal boolean expression with a Karnaugh map, we need to find the sm
# Three Variable Maps
![[Pasted image 20250224105753.png]]
A three variable Karnaugh map
A three variable Karnaugh map is constructed by placing 2 two-variable maps side by side. The values of $x_1$ and $x_2$ distinguish columns in the map, and the value of $x_3$ distinguishes rows in the map.
To convert a 3 variable Karnaugh map to a minimal boolean expression, start by looking for places in the map that contain 1s next to each other (by row, or by column).
![[Pasted image 20250224110124.png]]
From there, describe the pair of 1s using boolean a