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.

Slides:



Advertisements
Similar presentations
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals with PLD Programming.
Advertisements

Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 2 – Combinational.
EET 1131 Unit 6 Exclusive-OR and Exclusive-NOR Gates
EET 1131 Unit 3 Basic Logic Gates
Exclusive-OR and Exclusive-NOR Gates
Exclusive-OR and Exclusive-NOR Gates
Functions of Combinational Logic
Overview Part 2 – Combinational Logic Functions and functional blocks
EET 252 Digital Systems II Professor Nick Reeder.
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.
EET 1131 Unit 7 Arithmetic Operations and Circuits
Exclusive-OR and Exclusive-NOR Gates
Combinational Logic and Verilog. XORs and XNORs XOR.
CHAPTER 2 Digital Combinational Logic/Arithmetic Circuits.
Overview Part 2 – Combinational Logic
CHAPTER 6 Functions of Combinational Logic
EET 1131 Unit 8 Code Converters, Multiplexers, and Demultiplexers
Parity. 2 Datasheets TTL:  CMOS: 
Digital Fundamentals Floyd Chapter 2 Tenth Edition
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 3 – Combinational Logic Design Part 2 –
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
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
Digital Fundamentals Floyd Chapter 6 Tenth Edition
Error Detection/Correction Section 1.7 Section 3.9 Bonus Material: Hamming Code.
Digital Fundamentals with PLD Programming Floyd Chapter 8
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
Based on slides by: Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 10 – Other Gate Types.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals with PLD Programming.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
Module 3.  Binary logic consists of :  logic variables  designated by alphabet letters, e.g. A, B, C… x, y, z, etc.  have ONLY 2 possible values:
NOCTI Review Lesson 4 Objectives:
Fall 2004EE 3563 Digital Systems Design EE3563 Multiplexers  A multiplexer is a digital switch  Allows a device to select a single line from many  Some.
CS 151: Introduction to Digital Design Chapter 2-9 Exclusive-OR Gates.
Digital Logic Design Week 3
Exclusive OR Gate. Logically, the exclusive OR (XOR) operation can be seen as either of the following operations:exclusive OR (XOR) 1. A AND NOT B OR.
CS 1110 Digital Logic Design
Summary Half-Adder pp302Basic rules of binary addition are performed by a half adder, which has two binary inputs (A and B) and two binary outputs (Carry.
Digital Fundamentals Floyd Chapter 3 Tenth Edition
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
Chapter-3: BOOLEAN ALGEBRA & LOGIC GATES Analysis and logical design.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Binary Numbers For digital systems, the.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
Combinational Logic: Other Gate Types
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
A multiplexer (MUX) selects one data line from two or more input lines and routes data from the selected line to the output. The particular data line that.
The inverter performs the Boolean NOT operation. When the input is LOW, the output is HIGH; when the input is HIGH, the output is LOW. The Inverter AX.
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
Combinational Logic Design
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
EGR 2131 Unit 3 Gate-Level Minimization
Digital Fundamentals Floyd Chapter 3 Tenth Edition
Overview Part 2 – Combinational Logic Functions and functional blocks
Engr. Micaela Renee Bernardo
Digital Fundamentals Floyd Chapter 3 Tenth Edition
Overview Part 1 – Gate Circuits and Boolean Equations
PROPAGATION DELAY.
EET 1131 Unit 6 Exclusive-OR and Exclusive-NOR Gates
Combinational Logic Circuits
Digital Fundamentals Floyd Chapter 6 Tenth Edition
EET107/3 DIGITAL ELECTRONICS 1
Digital Fundamentals Floyd Chapter 3 Tenth Edition
EET 1131 Unit 6 Exclusive-OR and Exclusive-NOR Gates
Presentation transcript:

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 week.

© 2009 Pearson Education, Upper Saddle River, NJ All Rights Reserved The XOR gate produces a HIGH output only when the inputs are at opposite logic levels. The truth table is The XOR Gate A B XA B X The XOR operation is written as X = AB + AB. Alternatively, it can be written with a circled plus sign between the variables as X = A + B.

© 2009 Pearson Education, Upper Saddle River, NJ All Rights Reserved Example waveforms: A X Notice that the XOR gate will produce a HIGH only when exactly one input is HIGH. The XOR Gate B A B XA B X

© 2009 Pearson Education, Upper Saddle River, NJ All Rights Reserved Some common gate configurations are shown. Fixed Function Logic

© 2009 Pearson Education, Upper Saddle River, NJ All Rights Reserved The XNOR gate produces a HIGH output only when the inputs are at the same logic level. The truth table is The XNOR Gate A B XA B X The XNOR operation can be written as X = AB + AB or as X = A + B.

© 2009 Pearson Education, Upper Saddle River, NJ All Rights Reserved Example waveforms: A X Notice that the XNOR gate will produce a HIGH when both inputs are the same. This makes it useful for comparison functions. The XNOR Gate B A B XA B X

Applications of XOR and XNOR Gates  Three common applications: 1. Comparators 2. Controlled inverters 3. Parity generation and checking

Convention for Multi-Bit Strings  When dealing with multi-bit binary strings, we use subscripts to refer to the individual bits in the string.  The least significant bit (LSB) always gets the smallest subscript, which may be either 1 or 0.  Example: In a four-bit string A, the bits may be labeled either A 4 A 3 A 2 A 1 or A 3 A 2 A 1 A 0

Application #1: Comparator  A comparator compares two strings of bits to see whether they are equal to each other: Example: if string A = 0101 and string B = 0100, then A≠ B.  Next slide shows how to build a 4-bit comparator from XNOR gates.

Comparator Circuit (Book’s Fig. 6-14)

Application #2: Controlled Inverter  A controlled inverter takes an input string and, depending on the logic level on a control line, either Leaves the string unchanged or Inverts each bit in the string  Next slide shows how to build an 8-bit controlled inverter from XOR gates.

Controlled Inverter (Book’s Fig. 6-15)

© 2009 Pearson Education, Upper Saddle River, NJ All Rights Reserved Application #3: Parity Checking Parity checking is a method of error detection for simple transmission errors involving one bit. A parity bit is an “extra” bit attached to a group of bits to force the total number of 1’s to be either even (even parity) or odd (odd parity). The ASCII character for “a” is and for “A” is What is the correct bit to append to make both of these have odd parity? The ASCII “a” has an odd number of bits that are equal to 1; therefore the parity bit is 0. The ASCII “A” has an even number of bits that are equal to 1; therefore the parity bit is 1.

Parity Generators  To implement parity checking, we need circuitry on the sending end that generates the parity bit for each group of bits being sent. This circuitry is called a parity generator.  Next slide shows how to build 4-bit even or odd parity generators.

Parity Generators (Book’s Fig. 6-9)

Parity Checkers  On the receiving end, we need circuitry that checks the data bits and parity bit as they’re received to decide whether an error has occurred during transmission. This circuitry is called a parity checker.  Next slide shows how to build a 4- bit-plus-parity even parity checker.

Parity Checker (Book’s Fig. 6-11)

A Parity Generator/Checker Chip  Nine-bit Parity Generator/Checker  Most chips we’ve studied have been SSI (small-scale integration) chips containing fewer than 10 gates that are not connected to each other.  The is an MSI (medium-scale integration) chip. Instead of containing a few disconnected gates, it contains about 45 gates connected internally on the chip to perform a specific function.

Parity System (Book’s Fig. 6-13)

© 2009 Pearson Education, Upper Saddle River, NJ All Rights Reserved Parity Generator/Checker Chip The can be used to generate a parity bit or to check an incoming data stream for even or odd parity. Checker: The can test codes with up to 9 bits. The even output will be HIGH if the data lines have even parity; otherwise it will be LOW. Likewise, the odd output will be HIGH if the data lines have odd parity; otherwise it will be LOW. Generator: To generate even parity, the parity bit is taken from the odd parity output. To generate odd parity, the output is taken from the even parity output Data inputs  Even  Odd

Printing from Our Oscilloscopes  You can print the oscilloscope screen by pressing the PRINT button.  There’s a delay of about 40 seconds before the page will print, so be patient.  Only one oscilloscope can print at a time, or else the printer gets confused and prints hundreds of pages.  Please shout “Printing!” before you press the PRINT button, and make sure that you don’t print while someone else is waiting for their page to print.