Last Sync: 2022-07-09 15:30:05
This commit is contained in:
		
							parent
							
								
									0a054631cc
								
							
						
					
					
						commit
						d44e599b1c
					
				
					 2 changed files with 20 additions and 11 deletions
				
			
		| 
						 | 
					@ -1,20 +1,19 @@
 | 
				
			||||||
---
 | 
					---
 | 
				
			||||||
tags:
 | 
					tags:
 | 
				
			||||||
  - Theory_of_Computation
 | 
					 | 
				
			||||||
  - Logic
 | 
					  - Logic
 | 
				
			||||||
  - Electronics
 | 
					  - Electronics
 | 
				
			||||||
  - binary
 | 
					  - binary
 | 
				
			||||||
---
 | 
					---
 | 
				
			||||||
 | 
					
 | 
				
			||||||
 | 
					# Logic circuits
 | 
				
			||||||
 | 
					
 | 
				
			||||||
 > 
 | 
					 > Now that we are familiar with the individual [logic gates](Logic_gates.md) and their truth conditions we are in a position to create **logic circuits**. These are combinations of logic gates controlled by inputs that can provide a range of useful outputs. The output of a logic gate is a function of the truth-values of the individual gates and their connections to each other.
 | 
				
			||||||
 > Now that we are familiar with the individual logic gates and their truth conditions we are in a position to create **logic circuits**. These are combinations of logic gates controlled by inputs that can provide a range of useful outputs.
 | 
					 | 
				
			||||||
 | 
					
 | 
				
			||||||
## Basic example
 | 
					## Basic example
 | 
				
			||||||
 | 
					
 | 
				
			||||||
In the below circuit we have the following gates connected to two inputs with one output, moving through the following stages:
 | 
					In the below circuit we have the following gates connected to two inputs with one output, moving through the following stages:
 | 
				
			||||||
 | 
					
 | 
				
			||||||
1. `AND`, `NOT` , `NOT`
 | 
					1. `AND`, `NOT`, `NOT`
 | 
				
			||||||
1. `AND`, `NOR`
 | 
					1. `AND`, `NOR`
 | 
				
			||||||
 | 
					
 | 
				
			||||||
This is equivalent to the following truth table:
 | 
					This is equivalent to the following truth table:
 | 
				
			||||||
| 
						 | 
					@ -29,12 +28,19 @@ _    _   _____
 | 
				
			||||||
1    1     0       (4)
 | 
					1    1     0       (4)
 | 
				
			||||||
````
 | 
					````
 | 
				
			||||||
 | 
					
 | 
				
			||||||

 | 
					
 | 
				
			||||||
 | 
					
 | 
				
			||||||
*Line 1 of the truth table*
 | 
					*Line 1 of the truth table*
 | 
				
			||||||
 | 
					
 | 
				
			||||||

 | 
					
 | 
				
			||||||
 | 
					
 | 
				
			||||||
 | 
					
 | 
				
			||||||
 | 
					
 | 
				
			||||||
*Line 2 and 3 of the truth table (equivalent to each other)*
 | 
					*Line 2 and 3 of the truth table (equivalent to each other)*
 | 
				
			||||||

 | 
					
 | 
				
			||||||
 | 
					
 | 
				
			||||||
 | 
					
 | 
				
			||||||
 | 
					
 | 
				
			||||||
*Line 4 of the truth table*
 | 
					*Line 4 of the truth table*
 | 
				
			||||||
 | 
					
 | 
				
			||||||
## Applied example
 | 
					## Applied example
 | 
				
			||||||
| 
						 | 
					@ -47,8 +53,10 @@ It corresponds to an automatic sliding door and has the following states
 | 
				
			||||||
* a proximity sensor that opens the doors when someone approaches from the inside
 | 
					* a proximity sensor that opens the doors when someone approaches from the inside
 | 
				
			||||||
* a manual override that locks both approaches (inside and out) meaning no one can enter of leave
 | 
					* a manual override that locks both approaches (inside and out) meaning no one can enter of leave
 | 
				
			||||||
 | 
					
 | 
				
			||||||
Here's a visual representation:!
 | 
					Here's a visual representation:
 | 
				
			||||||
[logic_circuits_5.gif](../img/logic_circuits_5.gif)
 | 
					
 | 
				
			||||||
 | 
					
 | 
				
			||||||
 | 
					
 | 
				
			||||||
The following truth table represents this behaviour, with A and B as the door states, C as the override and X as the door action (0 = open, 1 = closed)
 | 
					The following truth table represents this behaviour, with A and B as the door states, C as the override and X as the door action (0 = open, 1 = closed)
 | 
				
			||||||
 | 
					
 | 
				
			||||||
````
 | 
					````
 | 
				
			||||||
| 
						 | 
					@ -65,5 +73,6 @@ _  _  _  _
 | 
				
			||||||
1  1  1  1
 | 
					1  1  1  1
 | 
				
			||||||
````
 | 
					````
 | 
				
			||||||
 | 
					
 | 
				
			||||||

 | 
					
 | 
				
			||||||
 | 
					
 | 
				
			||||||
*Automatic door sensor with manual override*
 | 
					*Automatic door sensor with manual override*
 | 
				
			||||||
| 
						 | 
					
 | 
				
			||||||
| 
						 | 
					@ -8,7 +8,7 @@ tags:
 | 
				
			||||||
 | 
					
 | 
				
			||||||
In essence the main memory is just a large storage area for a bunch of binary digits. Each slot for a 0 or 1 is called a bit:
 | 
					In essence the main memory is just a large storage area for a bunch of binary digits. Each slot for a 0 or 1 is called a bit:
 | 
				
			||||||
 | 
					
 | 
				
			||||||
> This is where the running kernal and processes reside - they're just big collections of bits. A CPU is just an operator on memory. It reads its instructions and data from the memory and write back out to the memory. (Ward 2021)
 | 
					> This is where the running kernal and processes reside - they're just big collections of bits. A CPU is just an operator on memory. It reads its instructions and data from the memory and writes back out to the memory. (Ward 2021)
 | 
				
			||||||
 | 
					
 | 
				
			||||||
## References
 | 
					## References
 | 
				
			||||||
 | 
					
 | 
				
			||||||
| 
						 | 
					
 | 
				
			||||||
		Loading…
	
	Add table
		
		Reference in a new issue