Presentation is loading. Please wait.

Presentation is loading. Please wait.

Henry Hexmoor--SIUC One bit Equality Comparator XNOR X Y Z Z = !(X $ Y) X Y Z 0 0 1 0 1 0 1 0 0 1 1 1.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Henry Hexmoor--SIUC One bit Equality Comparator XNOR X Y Z Z = !(X $ Y) X Y Z 0 0 1 0 1 0 1 0 0 1 1 1."— Presentation transcript:

1 Henry Hexmoor--SIUC One bit Equality Comparator XNOR X Y Z Z = !(X $ Y) X Y Z 0 0 1 0 1 0 1 0 0 1 1 1

2 4-Bit Equality Comparator FIELD A = [A0..3]; FIELD B = [B0..3]; FIELD C = [C0..3];

3

4 More gates Summary for all 2-input gates InputsOutput of each gate A B ANDNAND OR NORXORXNOR 00010101 01011010 10011010 11101001

5 AB ABAB 001 011 101 110

6

7 Base 8 Addition Table +01234567 001234567 1123456710 2234567 11 334567101112 4456710111213 55671011121314 667101112131415 7710111213141516

8 Base 8 Multiplication Table x01234567 0 0 1 1234567 2 24610121416 30361114172225 4 4101420243034 5 5121724313643 6 6142230364452 7 7162534435261

Download ppt "Henry Hexmoor--SIUC One bit Equality Comparator XNOR X Y Z Z = !(X $ Y) X Y Z 0 0 1 0 1 0 1 0 0 1 1 1."

Similar presentations

Test practice Multiplication. Multiplication 9x2.

Test practice Multiplication. Multiplication 9x2.
Comparators Combinational Design.

Comparators Combinational Design.
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.
AB 11 22 33 44 55 66 77 88 99 10  20  19  18  17  16  15  14  13  12  11  21  22  23  24  25  26  27  28.

AB 11 22 33 44 55 66 77 88 99 10  20  19  18  17  16  15  14  13  12  11  21  22  23  24  25  26  27  28.
Equality Detector Module M5.1 Section 6.1. Equality Detector XNOR X Y Z Z = !(X $ Y) X Y Z 0 0 1 0 1 0 1 0 0 1 1 1.

Equality Detector Module M5.1 Section 6.1. Equality Detector XNOR X Y Z Z = !(X $ Y) X Y Z
Combinational Comparators

Combinational Comparators
1 times table 2 times table 3 times table 4 times table 5 times table

1 times table 2 times table 3 times table 4 times table 5 times table
Lecture No. 14 Combinational Functional Devices svbitec.wordpress.com.

Lecture No. 14 Combinational Functional Devices svbitec.wordpress.com.
XOR, XNOR, and Binary Adders

XOR, XNOR, and Binary Adders
AND, OR and NOT. The AND gate needs to be both on, So number wise both 1. So then you will get a 1 as you can see in the last image on the right, If 1.

AND, OR and NOT. The AND gate needs to be both on, So number wise both 1. So then you will get a 1 as you can see in the last image on the right, If 1.
Digital Electronics.

Digital Electronics.
Binary Numbers.

Binary Numbers.
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.
Logic Gates. Transistors as Switches ¡EB voltage controls whether the transistor conducts in a common base configuraiton. ¡Logic circuits can be built.

Logic Gates. Transistors as Switches ¡EB voltage controls whether the transistor conducts in a common base configuraiton. ¡Logic circuits can be built.
Basic Logic Operations and Standard Logic Gates (Lecture #1) ECE 331 – Digital System Design.

Basic Logic Operations and Standard Logic Gates (Lecture #1) ECE 331 – Digital System Design.
Logic Gates. Outline  Logic Gates  The Inverter  The AND Gate  The OR Gate  The NAND Gate  The NOR Gate  The XOR Gate  The XNOR Gate  Drawing.

Logic Gates. Outline  Logic Gates  The Inverter  The AND Gate  The OR Gate  The NAND Gate  The NOR Gate  The XOR Gate  The XNOR Gate  Drawing.
Chapter 33 Basic Logic Gates. 2 Objectives –After completing this chapter, the student should be able to: Identify and explain the function of the basic.

Chapter 33 Basic Logic Gates. 2 Objectives –After completing this chapter, the student should be able to: Identify and explain the function of the basic.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.

Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
February 23, 2009. Announcements ACSL – March 9 Digital Electronics – 2 Graph Theory – 2 Boolean Algebra – 1 USACO – March 13-16.

February 23, Announcements ACSL – March 9 Digital Electronics – 2 Graph Theory – 2 Boolean Algebra – 1 USACO – March
Computer Science 101 Circuit Design - Examples. Sum of Products Algorithm Identify each row of the output that has a 1. Identify each row of the output.

Computer Science 101 Circuit Design - Examples. Sum of Products Algorithm Identify each row of the output that has a 1. Identify each row of the output.

Similar presentations

Ads by Google