vault backup: 2025-02-24 10:48:29
This commit is contained in:
@ -4,4 +4,7 @@ A Karnaugh map is an alternative to a truth table for representing a function in
|
||||
|
||||
Given the above truth table, the columns are labelled with $x_1$, and the rows are labelled with $x_2$.
|
||||
|
||||
To find a *minimum cost implementation*, we need to find the
|
||||
To find a minimum cost implementation, we need to find the smallest number of product terms that should produce a 1 for all instances where $m = 1$
|
||||
|
||||
In the above example,
|
||||
![[Pasted image 20250224104550.png]]
|
||||
|
Reference in New Issue
Block a user