note update

content/Boolean Algebra/Boolean Function.md

@@ -0,0 +1,22 @@
+---
+Author:
+  - Xinyang YU
+Author Profile:
+  - https://linkedin.com/in/xinyang-yu
+tags:
+  - boolean_algebra
+  - computer_organisation
+Creation Date: 2023-08-20T16:09:31+08:00
+Last Date: 2023-12-23T00:22:53+08:00
+References: 
+---
+## Abstract
+---
+- Use **Truth Table** to prove if 2 functions equal to each other
+- The above function is X [[AND]] Y [[AND]] C
+![[boolean functions.png]]
+
+## Complement Function
+---
+- Given [[Boolean Function]] F, the complement is denoted as F', is obtained by interchanging 1 with 0 & 0 with 1 in the function's output values
+- An [Example](https://chat.openai.com/share/f317b4c5-1b1c-4abf-b8e1-30c6ee185ba4)

content/Boolean Algebra/Boolean Standard Form.md

@@ -0,0 +1,39 @@
+---
+Author:
+  - Xinyang YU
+Author Profile:
+  - https://linkedin.com/in/xinyang-yu
+tags:
+  - boolean_algebra
+  - computer_organisation
+Creation Date: 2023-08-20T15:47:57+08:00
+Last Date: 2023-12-23T00:18:53+08:00
+References: 
+draft: 
+---
+## Abstract
+---
+- When it is expressed in [[#Sum-of-Products (SOP)]] or [[#Product-of-Sums (POS)]]
+
+
+
+
+## Terminologies 
+---
+### Boolean Variable
+-  A variables that hold either ``true`` or ``false``
+
+### Boolean Literal
+- A [[#Boolean Variable]] on its own or its complemented form
+
+### Sum Term
+-  A single [[#Boolean Literal]] or a [[OR]] of multiple Boolean Literals
+
+### Product Term
+- A single [[#Boolean Literal]] or a [[AND]] of several Boolean Literals
+
+### Product-of-Sums (POS) 
+- A single [[#Sum Term]] or [[AND]] of multiple Sum Term
+
+### Sum-of-Products (SOP) 
+- A [[#Product Term]] or a [[OR]] of multiple Product Term

content/Boolean Algebra/Logic Gates/Logical Product (AND).md → content/Boolean Algebra/Logic Gates/AND.md

@@ -7,14 +7,17 @@ tags:
   - boolean_algebra
   - computer_organisation
 Creation Date: 2023-09-21T13:26:58+08:00
-Last Date: 2023-09-21T13:26:58+08:00
-References:
+Last Date: 2023-12-23T00:23:48+08:00
+References: 
 ---
 ## Abstract
 ---
+- Logical Product
 - Made of 2 [[Transistors (晶体管)]]
  ![[AND.png]]
->[!note] Represented
->$$A\times B$$
->Or
->$$AB$$
+
+- Represented by
+
+$$A\times B$$
+
+$$AB$$

content/Boolean Algebra/Logic Gates/NOT Gate.md → content/Boolean Algebra/Logic Gates/NOT.md

@@ -7,13 +7,13 @@ tags:
   - boolean_algebra
   - computer_organisation
 Creation Date: 2023-09-21T13:27:34+08:00
-Last Date: 2023-09-21T13:27:34+08:00
-References:
+Last Date: 2023-12-23T00:26:18+08:00
+References: 
 ---
 ## Abstract
 ---
 - Made of 1 [[Transistors (晶体管)]]
 ![[NOT.png]]
->!
->[!note] Represented
->$$X'$$
+
+- Represented by
+$$X'$$

content/Boolean Algebra/Logic Gates/Logical Sum (OR).md → content/Boolean Algebra/Logic Gates/OR.md

@@ -7,20 +7,21 @@ tags:
   - boolean_algebra
   - computer_organisation
 Creation Date: 2023-11-24T18:38:25+08:00
-Last Date: 2023-11-24T18:38:25+08:00
-References:
+Last Date: 2023-12-23T00:25:22+08:00
+References: 
 ---
 ## Abstract
 ---
+- Logical Sum
 - Made of 2 [[Transistors (晶体管)]]
 ![[OR.png]]
->[!note] Represented
->$$A+B$$
+- Represented by
+$$A+B$$
 
 
 
 ## Use Cases
 ---
 ### Turn on Low-level Flags
-- Low-level things like [[Interrupts (中断)]] is represented in one bit, different [[Interrupts (中断)]] has different bit
+- Low-level things like [[Interrupts (中断)]] is represented in one bit, different Interrupts (中断) has different bit
 - We can use the *OR Gate* on the current status and the flags we want to turn on 

content/Boolean Algebra/Logic Gates/XOR (Exclusive OR) Gate.md → content/Boolean Algebra/Logic Gates/XOR.md

@@ -7,14 +7,24 @@ tags:
   - boolean_algebra
   - computer_organisation
 Creation Date: 2023-09-21T10:01:00
-Last Date: 2023-12-15T12:01:10+08:00
+Last Date: 2023-12-23T00:28:33+08:00
 References: 
 ---
 ## Abstract
 ---
+- *Exclusive OR*
 - Returns true only when 2 inputs aren't the same
 ![[XOR.png]]
 
+## Properties
+---
+### Self-Inverse
+- `a ^ a = 0`
+- `a` [[XOR]] `a` is always 0
+### Own-Inverse
+- `a ^ b ^ b = a`
+- W always get back the another half by [[XOR]] the another half one more time. Because [[#Self-Inverse]], `b ^ b = 0`
+
 ## Tricks
 ---
 ### Swapping values 
@@ -34,11 +44,3 @@ public class MyClass {
 }
 ```
 
-
-## Terminologies
----
-### Self-Inverse
-- `a ^ a = 0`
-### Own-Inverse
-- `a ^ b ^ b = a`
-- Because [[#Self-Inverse]], `b ^ b = 0`

content/Boolean Algebra/Minterms and Maxterms/Maxterm.md

@@ -7,10 +7,12 @@ tags:
   - boolean_algebra
   - computer_organisation
 Creation Date: 2023-08-20T15:56:23+08:00
-Last Date: 2023-08-20T15:56:23+08:00
-References:
+Last Date: 2023-12-23T00:16:14+08:00
+References: 
 ---
->[!abstract] A [[Sum Term]] that contains n [[Boolean Literals]] from all the [[Boolean Variables]]
->![[Minterms and Maxterms.png]]
+## Abstract
+---
+- A [[Boolean Standard Form#Sum Term]] that contains n [[Boolean Standard Form#Boolean Literal]] from all the [[Boolean Standard Form#Boolean Variable]]
+- Denoted  M0 to M[2^n-1]
+![[Minterms and Maxterms.png]]
 
->[!note] Denoted  M0 to M[2^n-1]

content/Boolean Algebra/Minterms and Maxterms/Minterm.md

@@ -7,10 +7,11 @@ tags:
   - boolean_algebra
   - computer_organisation
 Creation Date: 2023-08-20T15:58:24+08:00
-Last Date: 2023-08-20T15:58:24+08:00
-References:
+Last Date: 2023-12-23T00:18:10+08:00
+References: 
 ---
->[!abstract] A [[Product Term]] that contains n [[Boolean Literals]] from all the [[Boolean Variables]]
->![[Minterms and Maxterms.png]]
-
->[!note] Denoted  m0 to m[2^n-1]
+## Abstract
+---
+- A [[Boolean Standard Form#Product Term]] that contains n [[Boolean Standard Form#Boolean Literal]] from all the [[Boolean Standard Form#Boolean Variable]]
+- Denoted by m0 to m[2^n-1]
+![[Minterms and Maxterms.png]]