Autosave: 2022-12-19 07:30:04
This commit is contained in:
parent
3be197fef8
commit
17a184be3c
2 changed files with 17 additions and 1 deletions
16
Logic/Propositional_logic/Boolean_function_synthesis.md
Normal file
16
Logic/Propositional_logic/Boolean_function_synthesis.md
Normal file
|
@ -0,0 +1,16 @@
|
||||||
|
---
|
||||||
|
categories:
|
||||||
|
- Logic
|
||||||
|
- Computer Architecture
|
||||||
|
tags: [logic, propositional-logic, nand-to-tetris]
|
||||||
|
---
|
||||||
|
|
||||||
|
# Boolean function synthesis
|
||||||
|
|
||||||
|
When we looked at [boolean functions](/Logic/Propositional_logic/Boolean_functions.md) we were working in a particular direction: from a function to a truth table. When we do Boolean function synthesis we work in the opposite direction: from a function to a truth table.
|
||||||
|
|
||||||
|
This is an important skill that we will use when constructing [logic circuits](/Electronics_and_Hardware/Digital_circuits/Digital_circuits.md). We will go from truth conditions (i.e. what we want the circuit to do and when we want it to do it) to a function expression which is then reduced and implemented with [logic gates](/Electronics_and_Hardware/Digital_circuits/Logic_gates.md).
|
||||||
|
|
||||||
|
## The process
|
||||||
|
|
||||||
|
The process proceeds as follows:
|
|
@ -2,7 +2,7 @@
|
||||||
categories:
|
categories:
|
||||||
- Logic
|
- Logic
|
||||||
- Computer Architecture
|
- Computer Architecture
|
||||||
tags: [logic, propositional-logic]
|
tags: [logic, propositional-logic, nand-to-tetris]
|
||||||
---
|
---
|
||||||
|
|
||||||
# Boolean functions
|
# Boolean functions
|
||||||
|
|
Loading…
Add table
Reference in a new issue