SlideServe
Télécharger Obtenir Pro
Menu
Accueil Pro
Préférences
ApparenceLight Aide et commentaires
© SlideServe · v2026

Basic Logic Gates: Application in Digital Circuits

eunicem avatar
eunicem
22 diapositives · 290 Views · Jan 03, 2020

Explore the fundamentals of logic gates including AND, OR, NOT, NAND, and NOR gates. Learn about Disjunctive Normal Form, Output Tables, and Designing Circuits using different gate combinations. Delve into Conjunctive Normal Form and solve logic puzzles.

#basic logic gates: application in digital circuits #basic logic gates: application in digital circuits ppt #powerpoint #presentation
Basic Logic Gates: Application in Digital Circuits - slide 1
01 / 22Basic Logic Gates: Application in Digital Circuits
1 / 17

Télécharger la présentation

Basic Logic Gates: Application in Digital Circuits
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation

  1. Application: Digital Logic Circuits Lecture 4 Section 1.4 Wed, Jan 25, 2006

  2. Logic Gates • Three basic logic gates • AND-gate • OR-gate • NOT-gate • Two other gates • NAND-gate (NOT-AND) • NOR-gate (NOT-OR)

  3. AND-Gate • Output is 1 if both inputs are 1. • Output is 0 if either input is 0.

  4. OR-Gate • Output is 1 if either input is 1. • Output is 0 if both inputs are 0.

  5. NOT-Gate • Output is 1 if input is 0. • Output is 0 if input is 1.

  6. NAND-Gate • Output is 1 if either input is 0. • Output is 0 if both inputs are 1.

  7. NOR-Gate • Output is 1 if both inputs are 0. • Output is 0 if either input is 1.

  8. Disjunctive Normal Form • A logical expression is in disjunctive normal form if • It is a disjunction of clauses. • Each clause is a conjunction of variables and their negations. • Each variable or its negation appears in each clause exactly once.

  9. Examples: Disjunctive Normal Form • pq (pq)  (pq)  (pq). • p q (pq)  (pq). • p | q (pq)  (p q)  (pq). • pqpq.

  10. Output Tables • An output table shows the output of the circuit for every possible combination of inputs.

  11. Designing a Circuit • Write an output table for the circuit. • Write the expression in disjunctive normal form. • Simplify the expression as much as possible. • Write the circuit using AND-, OR-, and NOT-gates.

  12. Example: Designing a Circuit • Design a circuit for (pq).

  13. Example: Designing a Circuit • (pq) is equivalent to pq. • Draw the circuit using an AND-gate and a NOT-gate.

  14. Example: Designing a Circuit • Design a circuit for (pq)  (qr).

  15. Example: Designing a Circuit • (pq)  (qr) is equivalent to (pqr)  (pqr)  (pqr). • Does this simplify? • In any case, we can draw a circuit, although it may not be optimal.

  16. Example: Designing a Circuit • Design a logic circuit for (pq)  (q r) r.

  17. Conjunctive Normal Form • A logical expression is in conjunctive normal form if • It is a conjunction of clauses. • Each clause is a disjunction of variables and their negations. • Each variable or its negation appears in each clause exactly once.

  18. Examples: Conjunctive Normal Form • pqpq. • p q (pq)  (pq). • p | qpq. • pq (pq)  (pq)  (pq).

  19. Conjunctive Normal Form • To write an expression in CNF, • Write the output table (truth table). • Follow the procedure for writing the expression in DNF, except • Reverse the rolls of 0 and 1 and  and .

  20. Example: Using CNF • Re-do the previous example (pq)  (q r) r. using the conjunctive normal form.

  21. The Red Dot-Blue Dot Puzzle • Three men apply for a job. • They are equally well qualified, so the employer needs a way to choose one. • He tells them • “On the forehead of each of you I will put either a red dot or a blue dot.” • “At least one of you will have a red dot.” • “The first one who can tell me the color of the dot on his forehead gets the job.”

  22. The Red Dot-Blue Dot Puzzle • The employer proceeds to put a red dot on each man’s forehead. • After a few moments, one of them says, “I have a red dot.” • How did he know?