Logic Gates
A computer, or other electronic device, is made up of a number of circuits.
The components in a logical circuit takes 0 and 1 as inputs. 1 is the state where there is a voltage on the input and 0 is the state where there is no voltage on the input. Therefore, Boolean algebra is used to model the circuitry in electronic devices. The absence of a voltage is usually denoted as 0 (zero) and the presence of a voltage is denoted by 1 (one).
As mentioned earlier, concepts of Boolean algebra can be used to simplify logical circuitry. There are a set of components that matches the Boolean operators discussed earlier. These components are called Logic Gates.
Basic Logic Gates (NOT Gate)
Complement → NOT Gate.
Also known as inverter or complementer. Consists of a single input and a single output. As in the complement, the input gets inverted.
Basic Logic Gates (OR Gate)
Boolean Sum → OR Gate.
Consists of two inputs and a single output. As in the sum, the output is 1 if at least one input is 1.
Basic Logic Gates (AND Gate)
Boolean Product → AND Gate.
Consists of two inputs and a single output.
As in the product, the output is 0 if at least one input is 0.
Derived Logic Gates (NAND Gate)
Created by combining an AND gate with a NOT gate.
Derived Logic Gates (NOR Gate)
Created by combining an OR gate with a NOT gate.
Derived Logic Gates (XOR Gate)
Similar to the OR Gate.
Consists of two inputs and a single output.
The output is 1 if ONLY ONE input is 1.
Universality of NAND and NOR Gates
Basic gates can be derived using the NAND and NOR
gates. It has been identified that NAND can be replaced by NOR or otherwise,
https://youtu.be/qdL63h5A0Y8
ReplyDeletethis is so funny...