ECE Digital Electronics

Slides:



Advertisements
Similar presentations
INTRODUCTION LOGICAL OPERATIONS TRUTH TABLE AND RULES.
Advertisements

Presented by: Ms. Maria Estrellita D. Hechanova, ECE
Logic Functions Logical functions can be expressed in several ways: ▫ Truth table ▫ Logical expressions ▫ Graphical form prepared by:eng.Rula Amjed.
ECE 331 – Digital System Design Boolean Algebra (Lecture #3) The slides included herein were taken from the materials accompanying Fundamentals of Logic.
1 CK Cheng CSE Dept. UC San Diego CS 140, Lecture 2 Combinational Logic.
BOOLEAN LOGIC CSC 171 FALL 2004 LECTURE 7. ASSIGNMENT Review Quiz # 2 Start reading Chapter 5.
Circuit Simplification: Boolean Algebra
Boolean Algebra. Introduction 1854: Logical algebra was published by George Boole  known today as “Boolean Algebra” 1854: Logical algebra was published.
Programming for GCSE Topic 3.3: Boolean Logic and Truth Tables
Computer Organization
Binary Logic and Gates Binary variables take on one of two values.
Digital Electronics. Introduction to Number Systems & Codes Digital & Analog systems, Numerical representation, Digital number systems, Binary to Decimal.
ECE 331 – Digital System Design
Fall 2012: FCM 708 Foundation I Lecture 2 Prof. Shamik Sengupta
Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.
Discrete Mathematics and Its Applications.  The English mathematician George Boole ( ) sought to give symbolic form to Aristotle's system of.
BASIC LOGIC GATES. In studying digital in integrated circuits, one must start with the simples group of circuits, the SSIs or Small Scale Integrated Circuits.
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.
ECE 301 – Digital Electronics Basic Logic Operations, Boolean Expressions, and Boolean Algebra (Lecture #3)
Binary Logic Section 1.9. Binary Logic Binary logic deals with variables that take on discrete values (e.g. 1, 0) and with operations that assume logical.
1 BOOLEAN ALGEBRA Basic mathematics for the study of logic design is Boolean Algebra Basic laws of Boolean Algebra will be implemented as switching devices.
Digital Logic Design Week 4 Boolean algebra. Laws and rules De Morgan’s theorem Analysis of logic circuits Standard forms Project 1 preparation.
Figure 2.6. A truth table for the AND and OR operations. 2.3 Truth Tables 1.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI Dale Roberts, Lecturer Computer Science, IUPUI
CEC 220 Digital Circuit Design Boolean Algebra I Wed, Sept 2 CEC 220 Digital Circuit Design Slide 1 of 13.
CEC 220 Digital Circuit Design Boolean Algebra Friday, January 17 CEC 220 Digital Circuit Design Slide 1 of 22.
Lecture 3 Combinational Circuits
Chapter 2 Boolean Algebra and Minimization Techniques.
Laws of Boolean Algebra Commutative Law Associative Law Distributive Law Identity Law De Morgan's Theorem.
Assoc. Prof. Dr. Ahmet Turan ÖZCERİT.  Boolean postulate  Simplifying boolean equations  Truth tables You will learn: 2.
Chapter 4 Fundamentals of Computer Logic 1 Chapter 4: Fundamental of Computer Logic - IE337.
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,
Logic Gates Digital Electronics.
Logic Gates M. AL-Towaileb1. Introduction Boolean algebra is used to model the circuitry of electronic devices. Each input and each output of such a device.
Module –I Boolean Algebra Digital Design Amit Kumar Assistant Professor SCSE, Galgotias University, Greater Noida.
ECE DIGITAL LOGIC LECTURE 6: BOOLEAN ALGEBRA Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2016, 02/01/2016.
Boolean Algebra Boolean algebra was introduced by George Boole in his first book The Mathematical Analysis of Logic (1847), perfected in the late 19th.
Logic Simplification-Using Boolean Laws Logic Design Laboratory EE 2121 Lectures By Manesh T EE2121-In Charge
DIGITAL ELECTRONICS. Everything in digital world is based on binary system. Numerically it involves only two symbols 0 or 1. –0 = False = No –1 = True.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Introduction to Digital Electronics Lecture.
ECE 301 – Digital Electronics
Chapter 11 (Part 1): Boolean Algebra
Logic Gates and Boolean Algebra
Gate Circuits and Boolean Equations
CHAPTER 2 Boolean Algebra
CHAPTER 1 : INTRODUCTION
Boolean Algebra.
Boolean Expressions Lecture No. 10.
Boolean Algebra.
Dr. Clincy Professor of CS
Aberdeen Grammar School
Logic Gates L Al-zaid Math110.
Elec 2607 Digital Switching Circuits
Boolean Algebra Digital Electronics
Circuit Simplification: Boolean Algebra
February 7, 2002 John Wawrzynek
Boolean algebra. Definition Boolean Algebra is used to analyze and simplify the digital (logic) circuits. It uses only the binary numbers i.e. 0 and 1.
Lecture 20: Combinatorial Circuits I
Boolean Algebra Introduction CSCI 240
Boolean Algebra.
ECB2212-Digital Electronics Boolean algebra
Logic Gates Dr.Halimah Alshehri.
Instructor: Alexander Stoytchev
Introductory Concepts
BOOLEAN ALGEBRA.
Boolean Algebra and Gate Networks
Digital Systems Section 3 Boolean Algebra. Digital Systems Section 3 Boolean Algebra.
Boolean Algebra.
Boolean Algebra S.SADHISH PRABHU.
Presentation transcript:

ECE 301 - Digital Electronics Lecture No. 11 Boolean Algebra ECE 301 - Digital Electronics

ECE 301 - Digital Electronics Boolean Algebra George Boole developed an algebraic description for processes involving logical thought and reasoning. Became known as Boolean Algebra Claude Shannon later demonstrated that Boolean Algebra could be used to describe switching circuits. Switching circuits are circuits built from devices that switch between two states (e.g. 0 and 1). Switching Algebra is a special case of Boolean Algebra in which all variables take on just two distinct values Boolean Algebra is a powerful tool for analyzing and designing logic circuits. ECE 301 - Digital Electronics

Basic Laws and Theorems ECE 301 - Digital Electronics

Idempotence A + A = A A . A = A F = ABC + ABC' + ABC F = ABC + ABC' Note: terms can also be added using this theorem A . A = A G = (A' + B + C').(A + B' + C).(A + B' + C) G = (A' + B + C') + (A + B' + C) ECE 301 - Digital Electronics

Complement A + A' = 1 A . A' = 0 F = ABC'D + ABCD F = ABD.(C' + C) G = (A + B + C + D).(A + B' + C + D) G = (A + C + D) + (B . B') G = A + C + D ECE 301 - Digital Electronics