Presentation is loading. Please wait.

Presentation is loading. Please wait.

5.8 Exclusive-OR Gates and Parity Circuits ReturnNext Exclusive-OR(XOR) Gates Exclusive-NOR(XNOR) Gates x ⊕ y=x · y+x · y x ⊙ y=x · y+x · y 0 1 1 0 0 1.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "5.8 Exclusive-OR Gates and Parity Circuits ReturnNext Exclusive-OR(XOR) Gates Exclusive-NOR(XNOR) Gates x ⊕ y=x · y+x · y x ⊙ y=x · y+x · y 0 1 1 0 0 1."— Presentation transcript:

1 5.8 Exclusive-OR Gates and Parity Circuits ReturnNext Exclusive-OR(XOR) Gates Exclusive-NOR(XNOR) Gates x ⊕ y=x · y+x · y x ⊙ y=x · y+x · y 0 1 1 0 0 1 0 0 1 1 0 1 X Y Inputs x⊕yx⊕y x⊙yx⊙y Outputs

2  Equivalent symbols for XOR and XNOR gates NextBackReturn 5.8 Exclusive-OR Gates and Parity Circuits (a) XOR gates (b) XNOR gates Prove the upper symbols for XOR and XNOR is equivalent.

3  Parity Circuits (p413 Figure 5-74) NextBackReturn 5.8 Exclusive-OR Gates and Parity Circuits  The 74x280 9-Bit Parity Generator (p414 Figure 5-75) A B C D EVEN E F ODD G H I 74X280 5 12 8 9 10 11 13 1 2 4 6

4 BackReturn 5.8 Exclusive-OR Gates and Parity Circuits  Parity-Checking Applications (p415 Figure 5-76)  Parity Circuits are also used with error- correcting codes (p416 Figure 5-77)

Download ppt "5.8 Exclusive-OR Gates and Parity Circuits ReturnNext Exclusive-OR(XOR) Gates Exclusive-NOR(XNOR) Gates x ⊕ y=x · y+x · y x ⊙ y=x · y+x · y 0 1 1 0 0 1."

Similar presentations

Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 2 – Combinational.

Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 2 – Combinational.
Other Gate Types COE 202 Digital Logic Design Dr. Aiman El-Maleh

Other Gate Types COE 202 Digital Logic Design Dr. Aiman El-Maleh
topics Logic gates Gates types Universal gates

topics Logic gates Gates types Universal gates
5.5 Encoders A encoder is a multiple-input, multiple-output logic circuit that converts coded inputs into coded outputs, where the input and output codes.

5.5 Encoders A encoder is a multiple-input, multiple-output logic circuit that converts coded inputs into coded outputs, where the input and output codes.
5.4 Decoders A decoder is a multiple-input, multiple-output logic circuit that converts coded inputs into coded outputs, where the input and output codes.

5.4 Decoders A decoder is a multiple-input, multiple-output logic circuit that converts coded inputs into coded outputs, where the input and output codes.
Limitations are  The number of inputs (n)  The number of outputs (m)  The number of product terms (p) 5.3 Combinational PLDs ReturnNext Programmable.

Limitations are  The number of inputs (n)  The number of outputs (m)  The number of product terms (p) 5.3 Combinational PLDs ReturnNext Programmable.
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.

ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.
ReturnNext A circuit that compares two binary words and indicates whether they are equal is called a comparator. Some comparators interpret their input.

ReturnNext A circuit that compares two binary words and indicates whether they are equal is called a comparator. Some comparators interpret their input.
Overview Part 3 – Additional Gates and Circuits 2-8 Other Gate Types

Overview Part 3 – Additional Gates and Circuits 2-8 Other Gate Types
Exclusive-OR and Exclusive-NOR Gates

Exclusive-OR and Exclusive-NOR Gates
Combinational Logic and Verilog. XORs and XNORs XOR.

Combinational Logic and Verilog. XORs and XNORs XOR.
Module 8.  In Module 3, we have learned about Exclusive OR (XOR) gate.  Boolean Expression AB’ + A’B = Y also A  B = Y  Logic Gate  Truth table ABY.

Module 8.  In Module 3, we have learned about Exclusive OR (XOR) gate.  Boolean Expression AB’ + A’B = Y also A  B = Y  Logic Gate  Truth table ABY.
EET 1131 Unit 6 Exclusive-OR and Exclusive-NOR Gates  Read Kleitz, Chapter 6.  Do Unit 6 e-Lesson.  Homework #6 and Lab #6 due next week.  Quiz next.

EET 1131 Unit 6 Exclusive-OR and Exclusive-NOR Gates  Read Kleitz, Chapter 6.  Do Unit 6 e-Lesson.  Homework #6 and Lab #6 due next week.  Quiz next.
Parity. 2 Datasheets TTL:  CMOS: 

Parity. 2 Datasheets TTL:  CMOS: 
Gate-Level Minimization. Digital Circuits 3-2 3-1 The Map Method The complexity of the digital logic gates the complexity of the algebraic expression.

Gate-Level Minimization. Digital Circuits The Map Method The complexity of the digital logic gates the complexity of the algebraic expression.
CS 151 Digital Systems Design Lecture 11 NAND and XOR Implementations.

CS 151 Digital Systems Design Lecture 11 NAND and XOR Implementations.
ENGIN112 L11: NAND and XOR Implementation September 26, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 11 NAND and XOR Implementations.

ENGIN112 L11: NAND and XOR Implementation September 26, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 11 NAND and XOR Implementations.
Basic Digital Design Discussion D2.3. Basic Digital Design Sum of Products Design –Minterms Product of Sums Design –Maxterms.

Basic Digital Design Discussion D2.3. Basic Digital Design Sum of Products Design –Minterms Product of Sums Design –Maxterms.
 We can use an algebraic description of the circuit ’ s functional behavior in the analysis of a larger system that includes the circuit.  We can determine.

 We can use an algebraic description of the circuit ’ s functional behavior in the analysis of a larger system that includes the circuit.  We can determine.
3.1 Logic Signals and Gates Logic Signals ReturnNext  Logic Value: Many physical quantities can be represented two possible numbers or logic values —

3.1 Logic Signals and Gates Logic Signals ReturnNext  Logic Value: Many physical quantities can be represented two possible numbers or logic values —

Similar presentations

Ads by Google