Presentation is loading. Please wait.

Presentation is loading. Please wait.

XOR, XNOR, and Binary Adders

Published byPercival Quinn Modified over 5 years ago

Similar presentations

Presentation on theme: "XOR, XNOR, and Binary Adders"— Presentation transcript:

1 XOR, XNOR, and Binary Adders
XOR, XNOR, & Adders Digital Electronics Lesson 2.4 – Specific Comb Circuit & Misc Topics XOR, XNOR, and Binary Adders Digital Electronics © 2014 Project Lead The Way, Inc. Project Lead The Way, Inc. Copyright 2009

2 XOR, XNOR & Adders This presentation will demonstrate
Digital Electronics Lesson 2.4 – Specific Comb Circuit & Misc Topics This presentation will demonstrate The basic function of the exclusive OR (XOR) gate. The basic function of the exclusive NOR (XNOR) gate. How XOR and XNOR gates can be used to implement combinational logic design. How XOR gates can be using to design half and full adders. How full adders can be implemented with Small Scale Integration (SSI) and Medium Scale Integration (MSI) logic. How single bit half and full adders can be cascaded to make multi-bit adders. Introductory Slide / Overview of Presentation Project Lead The Way, Inc. Copyright 2009

3 XOR Gate – Exclusive OR This is the XOR gate X Y X Y Z 1
XOR, XNOR, & Adders Digital Electronics Lesson 2.4 – Specific Comb Circuit & Misc Topics This is the XOR gate X Y X Y Z 1 Overview of basic XOR gates: Logic Symbol, Logic Expression, and Truth Table. Project Lead The Way, Inc. Copyright 2009

4 XNOR Gate – Exclusive NOR
XOR, XNOR, & Adders Digital Electronics Lesson 2.4 – Specific Comb Circuit & Misc Topics This is the Xnor gate X Y X Y Z 1 Overview of basic XNOR gates: Logic Symbol, Logic Expression, and Truth Table. Project Lead The Way, Inc. Copyright 2009

5 Binary Addition Single Bit Addition: Multiple Bit Addition: Carry Cout
XOR, XNOR, & Adders Digital Electronics Lesson 2.4 – Specific Comb Circuit & Misc Topics Single Bit Addition: Carry Multiple Bit Addition: Cin Cout A B Sum This slide shows the four possible combinations of adding together two single bit binary numbers and how these single bits can be cascaded into the addition of two 4-bit binary numbers. The 4-bit is just an example; we could have used 8-bits, 12-bits, etc. Project Lead The Way, Inc. Copyright 2009

6 There are Two Types of Adders
XOR, XNOR, & Adders There are Two Types of Adders Digital Electronics Lesson 2.4 – Specific Comb Circuit & Misc Topics Half Adder Full Adder 2 Inputs (A & B) 2 Outputs (Sum & Cout) Used for LSB only 3 Inputs (A, B, Cin) 2 Outputs (Sum & Cout) Used for all other bits Half Adder A B Sum Cout Full Adder A B Cin Sum Cout Explain the two types of adders, half adder and full adder. Project Lead The Way, Inc. Copyright 2009

7 Half Adder – Design A B Sum Cout 1
XOR, XNOR, & Adders Half Adder – Design Digital Electronics Lesson 2.4 – Specific Comb Circuit & Misc Topics A B Sum Cout 1 This slide includes a truth table and logic equations for a half adder. Neither K-Mapping nor Boolean algebra were required because of the simplicity of the logic. Project Lead The Way, Inc. Copyright 2009

8 Full Adder – Design of Cout
XOR, XNOR, & Adders Digital Electronics Lesson 2.4 – Specific Comb Circuit & Misc Topics A B Cin Sum Cout 1 V 1 Truth table for full adder and K-Map for the Cout output of the full adder. Project Lead The Way, Inc. Copyright 2009

9 Full Adder – Design of Sum
XOR, XNOR, & Adders Digital Electronics Lesson 2.4 – Specific Comb Circuit & Misc Topics A B Cin Sum Cout 1 V 1 Truth table for full adder and K-Map for the Sum output of the full adder. Note that the K-Map did not simplify the expression. K-Mapping did NOT help us simplify Let’s try Boolean algebra. Project Lead The Way, Inc. Copyright 2009

10 Boolean Simplification of Sum
XOR, XNOR, & Adders Digital Electronics Lesson 2.4 – Specific Comb Circuit & Misc Topics Boolean algebra simplification for the sum output of a full adder. Project Lead The Way, Inc. Copyright 2009

11 Full Adder - Circuit Logic diagram for a full adder.
XOR, XNOR, & Adders Digital Electronics Lesson 2.4 – Specific Comb Circuit & Misc Topics Logic diagram for a full adder. Project Lead The Way, Inc. Copyright 2009

12 Full Adder: Why use XOR instead of AOI
XOR, XNOR, & Adders Full Adder: Why use XOR instead of AOI Digital Electronics Lesson 2.4 – Specific Comb Circuit & Misc Topics Though XOR gates can be used for implementing any combinational logic design, their primary application is adder circuits. Compare the AOI implementation (above) for the sum function to the XOR implementation (below). This slide compares the sum output of a full adder, one implemented with AOI logic, and one implemented with XOR. This illustrates why we have XOR gates. Project Lead The Way, Inc. Copyright 2009

13 MSI Full Adder SSI - Full Adder MSI - Full Adder
XOR, XNOR, & Adders Digital Electronics Lesson 2.4 – Specific Comb Circuit & Misc Topics MSI is medium scale integration. Chips with more complex circuits on them. Introduction of the 74LS183 MSI full adder SSI - Full Adder MSI - Full Adder SSI is small scale integration. Chips like the 7400, 7404, 7408 etc. Project Lead The Way, Inc. Copyright 2009

14 Cascading Adders – Four Bits
XOR, XNOR, & Adders Digital Electronics Lesson 2.4 – Specific Comb Circuit & Misc Topics How to add 2 4-bit numbers Example: = 9 This slide provides an example and general form for cascading single bit adders into four bit adders. The 4-bit adder is simply being used as an example. General Form Project Lead The Way, Inc. Copyright 2009

15 Four Bit Adder with SSI Logic
XOR, XNOR, & Adders Four Bit Adder with SSI Logic Digital Electronics Lesson 2.4 – Specific Comb Circuit & Misc Topics Full Adder Full Adder 4-Bit adders built with SSI. Note that the LSB only required a half adder. Full Adder Half Adder Project Lead The Way, Inc. Copyright 2009

16 Four Bit Adder with MSI Logic
XOR, XNOR, & Adders Four Bit Adder with MSI Logic Digital Electronics Lesson 2.4 – Specific Comb Circuit & Misc Topics Full Adder Full Adder Full Adder 4-Bit adders built with MSI. Note that the LSB is a full adder. We must contact the Cin to a logic zero (i.e., ground). Full Adder Project Lead The Way, Inc. Copyright 2009

Download ppt "XOR, XNOR, and Binary Adders"

Similar presentations

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.
ECE 301 – Digital Electronics

ECE 301 – Digital Electronics
Combinational circuits

Combinational circuits
TDC 311 Digital Logic. Truth Tables  AND  OR  NOT  NAND  NOR  XOR  XNOR.

TDC 311 Digital Logic. Truth Tables  AND  OR  NOT  NAND  NOR  XOR  XNOR.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 1 1 F = x + y’z x y z F Truth Table Boolean Function.

Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
XOR, XNOR, and Binary Adders

XOR, XNOR, and Binary Adders
Binary Numbers.

Binary Numbers.
Binary Addition CSC 103 September 17, 2007.

Binary Addition CSC 103 September 17, 2007.
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.

XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.

Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.
ADDERS Half Adders Recall that the basic rules of binary addition are as indicated below in Table 2-9. A circuit known as the half-adder carries out these.

ADDERS Half Adders Recall that the basic rules of binary addition are as indicated below in Table 2-9. A circuit known as the half-adder carries out these.
Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.

Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.

Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
Logic Gates Logic gates are electronic digital circuit perform logic functions. Commonly expected logic functions are already having the corresponding.

Logic Gates Logic gates are electronic digital circuit perform logic functions. Commonly expected logic functions are already having the corresponding.
4. Computer Maths and Logic 4.2 Boolean Logic 4.2.4 Logic Circuits.

4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
Universal college of engineering & technology. .By Harsh Patel) 130460111012.

Universal college of engineering & technology. .By Harsh Patel)
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.

ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.
Explain Half Adder and Full Adder with Truth Table.

Explain Half Adder and Full Adder with Truth Table.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.

LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
Logic Gates Learning Objectives Learn that there is a one-to-one relationship between logic gates and Boolean expressions Learn how logic gates are combined.

Logic Gates Learning Objectives Learn that there is a one-to-one relationship between logic gates and Boolean expressions Learn how logic gates are combined.

Similar presentations

Ads by Google