Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.

Slides:

Advertisements

Similar presentations

Advertisements

CT455: Computer Organization Logic gate

Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR

Boolean Algebra and Logic Gate

Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.

Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.

Logic Gates Circuits to manipulate 0’s and 1’s. 0’s and 1’s used for numbers Also to make decisions within the computer. In that context, 1 corresponds.

1 Fundamentals of Computer Science Propositional Logic (Boolean Algebra)

Lecture 17: Digital Design Today’s topic –Intro to Boolean functions Reminders –HW 4 due Wednesday 10/8/2014 (extended) –HW 5 due Wednesday 10/15/2014.

Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.

LOGIC GATES & TRUTH TABLE – Digital Circuit 1 Choopan Rattanapoka.

CPS3340 COMPUTER ARCHITECTURE Fall Semester, /05/2013 Lecture 4: Basics of Logic Design Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER.

Lecture 22: 11/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.

Week 6: Gates and Circuits: PART I READING: Chapter 4.

Boolean Algebra & Logic Prepared by Dr P Marais (Modified by D Burford)

Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.

LOGIC GATES AND CIRCUITS Digital systems are said to be constructed by using logic gates. These gates are the AND, OR, NOT, NAND, NOR, EXOR and EXNOR gates.

+ CS 325: CS Hardware and Software Organization and Architecture Gates and Boolean Algebra Part 2.

ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.

Linear Algebra. Circuits The circuits in computers and other input devices have inputs, each of which is either a 0 or 1, the output is also 0s and 1s.

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

CHAPTER 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs

COMPUTER ARCHITECTURE TRUTH TABLES AND LOGIC GATES.

Logic Gates. A logic gate is an elementary building block of a digital circuit. Most logic gates have two inputs and one output. At any given moment,

C.S. Choy21 BOOLEAN ALGEGRA The Mathematics of logic Boolean variables have only two possible values (binary) Operators:. Product+ SumComplement A.B A+B.

CHAPTER 5 Combinational Logic Analysis

CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.

COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.

Dept. of Electrical and Computer Eng., NCTU 1 Lab 2. NAND and XOR Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu.

Basic Logic Gates By : Ashima Wadhwa Assistant Professor (giBS)

CEC 220 Digital Circuit Design SOP and POS forms Friday, Sept 11 CEC 220 Digital Circuit Design Slide 1 of 17.

Logic Gates and Boolean Algebra Introduction to Logic II.

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

LOGIC GATES. INTRODUCTION TO LOGIC GATES Boolean functions may be practically implemented by using electronic gates. The following points are important.

Hoda Roodaki Boolean Algebra Hoda Roodaki

Computer Architecture & Operations I

Computer Architecture & Operations I

Boolean Algebra & Logic Gates

Dr. Ameria Eldosoky Discrete mathematics

Morgan Kaufmann Publishers

Eng. Mai Z. Alyazji October, 2016

Logic Gates and Boolean Algebra

De Morgan’s Theorem,.

Logic Gates and Boolean Algebra

Logic Gates Benchmark Companies Inc PO Box Aurora CO

TN 221: DIGITAL ELECTRONICS 1

KS4 Electricity – Electronic systems

KS4 Electricity – Electronic systems

Digital Signals Digital Signals have two basic states:

Basic Digital Logic Basic Gates

Jeremy R. Johnson Wed. Sept. 29, 1999

Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan

Boolean Algebra & Logic Circuits

Agenda – 2/12/18 Questions? Readings: CSI 4, P

Boolean Algebra.

CSC 220: Computer Organization Logic Gates and Functions

KS4 Electricity – Electronic systems

Chapter 4 Gates and Circuits.

Digital Logic Design Basics Combinational Circuits Sequential Circuits.

ECE 352 Digital System Fundamentals

Dept. of Electrical and Computer Eng., NCTU

Agenda Lecture Content: Combinatorial Circuits Boolean Algebras

Presentation transcript:

Logic Gates Shashidhara H S Dept. of ISE MSRIT

Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform the basic logical functions. The three fundamental gates are: AND: Is a logical product. Its output = 1, only if both inputs are 1. Boolean Expression: A B “product” Logic Gate: Truth Table: Complex digital functions that make up a computer are built from these basic digital building blocks A B C ABC

Basic Logic Design and Boolean Algebra · OR: Is a logical sum. Its output = 1 if either input = 1. Boolean Expression: A + B, “sum” Logic Gate: Truth Table: A B C ABC

Basic Logic Design and Boolean Algebra NOT: Is a logical inversion since its output is opposite of its input. __ Boolean Expression: A or ~A, “not” Logic Gate: Truth Table A~A AA _

Laws of Boolean Algebra Identity law: A + 0 = A and A 1 = A Zero and One laws: A + 1 = 1 and A 0 = 0 Inverse Laws: A + A = 1and A A = 0 Commutative laws: A + B = B + A and A B = B A Associative laws: A + (B + C) = (A + B) + C and A (B C) = (A B) C Distributive laws: A (B + C) = (A B) + (A C) and A + (B C) = (A + B) (A + C) _____ __ __ De Morgan’s laws: (A + B) = (A) (B) and _____ __ __ (A B) = (A) + (B)

More Logic Gates The basic digital building blocks for AND and OR can be combined with the NOT, inverter. The symbol used is a circle on the output. NAND: Is a NOT-AND. Its output = 1, only if both inputs are not 1. ____ Boolean Expression: A B Logic Gate: Truth Table: The NAND functions has traditionally been the universal gate in digital circuits. It is simple to implement in hardware and can be used to construct the other gates. A B C ABC

More Logic Gates · NOR: Is a NOT-OR. Its output = 1 only if no input = 1. _____ Boolean Expression: A + B Logic Gate: Truth Table: A B C ABC

More Logic Gates · XOR: Is an EXCLUSIVE-OR. Its output = 1 if the inputs are different and equal 0 if all are the same. Boolean Expression: A  B Logic Gate: Truth Table: _ _ Logical equivalent: (AB) + (AB) = C ABC A C B

More Logic Gates · XNOR: Is an EXCLUSIVE-OR. Its output = 1 if the inputs are different and equal 0 if all are the same. Boolean Expression: A  B Logic Gate: Truth Table: _ _ Logical equivalent: AB + AB = C ABC A C B