1 / 17

Basic Logic Gates

Basic Logic Gates.

enan
Télécharger la présentation

Basic Logic Gates

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Basic Logic Gates

  2. In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these devices contain only a maximum of 10 transistorized components inside, these chips normally contain a function used in boolean algebra. Switching functions using boolean algebra is the simplest operation used in digital circuits, since it only involves a zero (0) and a one (1) much like the false (if zero) and true (if one) signals of boolean algebra

  3. The NOT GATE • This type of gate accepts a single input (either a logic ‘0’ or a logic ‘1’) and inverts the signal. A Y

  4. The truth table for that gate is summarized as follows: • In equation form Y = A

  5. The AND GAte • This type of gate has two or more inputs, and if we follow simple logic, this implies the statement if any among the list is false, then the expression is false.

  6. The truth table for that gate is summarized as follows: • In equation form Y = A ● B • One can extend this to n inputs by using the following equation Y = A ● B ● C …….

  7. THE OR GATE • This is type of gate has two or more inputs, and if we follow simple logic, this implies the statement if any among the list is true, then the expression is true. A Y B

  8. The truth table for that gate is summarized as follows: • In equation form Y = A + B • One can extend this to n inputs by using the following equation Y = A + B + C …….

  9. The nand gate • This type of gate has two or more inputs, and it does the opposite of the AND gate. if any among the list is false, then the expression is true.

  10. The truth table for that gate is summarized as follows: • In equation form Y = A ● B • One can extend this to n inputs by using the following equation Y = A ●B ●C …….

  11. THE NOR GATE • This type of gate has two or more inputs, and it does the opposite of OR. if any among the list is true, then the expression is false

  12. The truth table for that gate is summarized as follows: • In equation form Y = A + B • One can extend this to n inputs by using the following equation Y = A + B + C …….

  13. The xor gate • This type of gate has two or more inputs, and it follows the exclusive OR Logic. This mean if the inputs are similar, the output is ‘0’. If the inputs are not similar then the output is ‘1’.

  14. The truth table for that gate is summarized as follows: • In equation form Y = A B • One can extend this to n inputs by using the following equation Y = A B C …….

  15. THE XNOR Gate • This type of gate has two or more inputs, and it does the opposite or XOR. This mean if the inputs are not similar, the output is ‘0’. If the inputs are similar then the output is ‘1’.

  16. The truth table for that gate is summarized as follows: • In equation form Y = A B • One can extend this to n inputs by using the following equation Y = A B C …….

  17. Example

More Related