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.

Slides:

Advertisements

Similar presentations

Test practice Multiplication. Multiplication 9x2.

Advertisements

Comparators Combinational Design.

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.

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

Combinational Comparators

1 times table 2 times table 3 times table 4 times table 5 times table

Lecture No. 14 Combinational Functional Devices svbitec.wordpress.com.

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.

Digital Electronics.

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.

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.

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.

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

Logic Gates. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.

Logic and computers 2/6/12. Binary Arithmetic /6/ Only two digits: the bits 0 and 1 (Think: 0 = F, 1.

CHAPTER 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs

5 - Digital Logic with Boolean Algebra

Logic Gates. AND gate Produces an output only if both inputs are on Input AInput BOutput (Q) Q=

$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.

Basic Logic Operations and Standard Logic Gates [Lecture:1] Instructor: Sajib Roy Lecturer, ETE, ULAB ETE 204 – Digital Electronics.

Tables Learning Support

Department of Preparatory Year, Umm Al Qura University CSCI 240 Digital Logic.

Simple ALU  Half adder  Full adder  Constructing 4 bits adder  ALU does several operations  General ALU structure  Timing diagram of adder  Overflow.

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.

Chapter 33 Basic Logic Gates. Objectives After completing this chapter, you will be able to: –Identify and explain the function of the basic logic gates.

Lecture No. 14 Combinational Functional Devices. Digital Logic &Design Dr. Waseem Ikram Lecture 14.

Digital Logic. Boolean Algebra to Logic Gates Logic circuits are built from components called logic gates. The logic gates correspond to Boolean operations.

Eng. Mai Z. Alyazji October, 2016

Multiplication table. x

Summary Half-Adder Basic rules of binary addition are performed by a half adder, which has two binary inputs (A and B) and two binary outputs (Carry out.

Number Systems Decimal (base 10) { }

Boolean Algebra.

Dots 5 × TABLES MULTIPLICATION.

Dots 5 × TABLES MULTIPLICATION.

Dots 2 × TABLES MULTIPLICATION.

5 × 7 = × 7 = 70 9 × 7 = CONNECTIONS IN 7 × TABLE

5 × 8 = 40 4 × 8 = 32 9 × 8 = CONNECTIONS IN 8 × TABLE

Dots 3 × TABLES MULTIPLICATION.

Dots 6 × TABLES MULTIPLICATION.

4 × 6 = 24 8 × 6 = 48 7 × 6 = CONNECTIONS IN 6 × TABLE

5 × 6 = 30 2 × 6 = 12 7 × 6 = CONNECTIONS IN 6 × TABLE

Dots 2 × TABLES MULTIPLICATION.

XOR Function Logic Symbol  Description  Truth Table 

Dots 4 × TABLES MULTIPLICATION.

Theremin Oscillator Circuit

10 × 8 = 80 5 × 8 = 40 6 × 8 = CONNECTIONS IN 8 × TABLE MULTIPLICATION.

3 × 12 = 36 6 × 12 = 72 7 × 12 = CONNECTIONS IN 12 × TABLE

3 times tables.

6 times tables.

Half & Full Subtractor Half Subtractor Full Subtractor.

Eng. Ahmed M Bader El-Din October, 2018

Dept. of Electrical and Computer Eng., NCTU

5 × 12 = × 12 = × 12 = CONNECTIONS IN 12 × TABLE MULTIPLICATION.

Half & Full Subtractor Half Subtractor Full Subtractor.

5 × 9 = 45 6 × 9 = 54 7 × 9 = CONNECTIONS IN 9 × TABLE

3 × 7 = 21 6 × 7 = 42 7 × 7 = CONNECTIONS IN 7 × TABLE

Dots 3 × TABLES MULTIPLICATION.

Multiplication Facts 3 x Table.

Presentation transcript:

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

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

More gates Summary for all 2-input gates InputsOutput of each gate A B ANDNAND OR NORXORXNOR

AB ABAB

Base 8 Addition Table

Base 8 Multiplication Table x