SYNERGY INSTITUTE OF ENGINEERING & TECHNOLOGY,DHENKANAL LECTURE NOTES ON DIGITAL ELECTRONICS CIRCUIT(SUBJECT CODE:PCEC4202)

Similar documents
ENGIN 112 Intro to Electrical and Computer Engineering

Summary. Boolean Addition

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

Assignment (3-6) Boolean Algebra and Logic Simplification - General Questions

Lecture (04) Boolean Algebra and Logic Gates

Lecture (04) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee

Circuit analysis summary

LSN 4 Boolean Algebra & Logic Simplification. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology

EEE130 Digital Electronics I Lecture #4_1

IT 201 Digital System Design Module II Notes

Digital Logic Design (CEN-120) (3+1)

Menu. Algebraic Simplification - Boolean Algebra EEL3701 EEL3701. MSOP, MPOS, Simplification

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

Combinational Logic Circuits

Boolean Algebra. P1. The OR operation is closed for all x, y B x + y B

Lecture 3: Binary Subtraction, Switching Algebra, Gates, and Algebraic Expressions

Introduction to Computer Architecture

Experiment 3: Logic Simplification

QUESTION BANK FOR TEST

Introduction to Boolean Algebra

Boolean Analysis of Logic Circuits

Introduction to Boolean Algebra

Combinational Circuits Digital Logic (Materials taken primarily from:

DeMorgan's Theorem. George Self. 1 Introduction

Boolean relationships on Venn Diagrams

DKT 122/3 DIGITAL SYSTEM 1

Experiment 4 Boolean Functions Implementation

CS470: Computer Architecture. AMD Quad Core

Chapter 2 Boolean algebra and Logic Gates

BOOLEAN ALGEBRA. Logic circuit: 1. From logic circuit to Boolean expression. Derive the Boolean expression for the following circuits.

Combinational Devices and Boolean Algebra

Chapter 2. Boolean Expressions:

Binary logic. Dr.Abu-Arqoub

Unit-IV Boolean Algebra

Lecture 5. Chapter 2: Sections 4-7

2.6 BOOLEAN FUNCTIONS

To write Boolean functions in their standard Min and Max terms format. To simplify Boolean expressions using Karnaugh Map.

Chapter 3. Boolean Algebra and Digital Logic

Lecture (05) Boolean Algebra and Logic Gates

CHAPTER-2 STRUCTURE OF BOOLEAN FUNCTION USING GATES, K-Map and Quine-McCluskey

Computer Science. Unit-4: Introduction to Boolean Algebra

Designing Computer Systems Boolean Algebra

Philadelphia University Faculty of Information Technology Department of Computer Science. Computer Logic Design. By Dareen Hamoudeh.

Points Addressed in this Lecture. Standard form of Boolean Expressions. Lecture 4: Logic Simplication & Karnaugh Map

Objectives: 1- Bolean Algebra. Eng. Ayman Metwali

Combinational Logic & Circuits

Variable, Complement, and Literal are terms used in Boolean Algebra.

UNIT 2 BOOLEAN ALGEBRA

Module -7. Karnaugh Maps

Ch. 5 : Boolean Algebra &

X Y Z F=X+Y+Z

Chapter 2. Boolean Algebra and Logic Gates

Announcements. Chapter 2 - Part 1 1

ELCT201: DIGITAL LOGIC DESIGN

Dr. Chuck Cartledge. 10 June 2015

BOOLEAN ALGEBRA. 1. State & Verify Laws by using :

ELCT201: DIGITAL LOGIC DESIGN

9/10/2016. The Dual Form Swaps 0/1 and AND/OR. ECE 120: Introduction to Computing. Every Boolean Expression Has a Dual Form

Spring 2010 CPE231 Digital Logic Section 1 Quiz 1-A. Convert the following numbers from the given base to the other three bases listed in the table:

Gate Level Minimization Map Method

LECTURE 2 An Introduction to Boolean Algebra

Austin Herring Recitation 002 ECE 200 Project December 4, 2013

Boolean Algebra and Logic Gates

ENGIN 112. Intro to Electrical and Computer Engineering

DIGITAL SYSTEM DESIGN

Boolean Algebra A B A AND B = A*B A B A OR B = A+B

2.1 Binary Logic and Gates

Digital Fundamentals

CDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012

2. BOOLEAN ALGEBRA 2.1 INTRODUCTION

CNS 188a Overview. Implementing Boolean functions with relay circuits, circuits of AON (AND, OR, NOT) gates and LT (Linear Threshold) gates

Logic Gates and Boolean Algebra ENT263

Definitions. 03 Logic networks Boolean algebra. Boolean set: B 0,

Read this before starting!

2008 The McGraw-Hill Companies, Inc. All rights reserved.

EECS150 Homework 2 Solutions Fall ) CLD2 problem 2.2. Page 1 of 15

[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics

Injntu.com Injntu.com Injntu.com R16

Gate Level Minimization

IST 4 Information and Logic

1. Prove that if you have tri-state buffers and inverters, you can build any combinational logic circuit. [4]

Boolean algebra. June 17, Howard Huang 1

1. Mark the correct statement(s)

R10. II B. Tech I Semester, Supplementary Examinations, May

Activity Boolean Algebra

DSAS Laboratory no 4. Laboratory 4. Logic forms


Review. EECS Components and Design Techniques for Digital Systems. Lec 05 Boolean Logic 9/4-04. Seq. Circuit Behavior. Outline.

Simplification of Boolean Functions

Computer Engineering Chapter 3 Boolean Algebra

Logic Design: Part 2

SWITCHING THEORY AND LOGIC CIRCUITS

Finite Math - J-term Homework. Section Inverse of a Square Matrix

A graphical method of simplifying logic

DIGITAL CIRCUIT LOGIC UNIT 5: KARNAUGH MAPS (K-MAPS)

Read this before starting!

Lecture 4: Implementation AND, OR, NOT Gates and Complement

1. What is y-chart? ans: The y- chart consists of three domains:- behavioral, structural and geometrical.

CS61C : Machine Structures

Combinational Circuits

Transcription:

Lecture No:5 Boolean Expressions and Definitions Boolean Algebra Boolean Algebra is used to analyze and simplify the digital (logic) circuits. It uses only the binary numbers i.e. 0 and 1. It is also called as Binary Algebra or logical Algebra. Boolean algebra was invented by George Boole in 1854. Lows of Boolean Algebra Commutative Lows: The commutative laws are applied to addition and multiplication. For addition, the commutative law states: In terms of the result, the order in which variables are ORed makes no difference. A + B = B + A For multiplication, the commutative law states: In terms of the result, the order in which variables are ANDed makes no difference. AB = BA Associative Laws: The associative laws are also applied to addition and multiplication. For addition, the associative law states: When ORing more than two variables, the result is the same regardless of the grouping of the variables. A + (B +C) = (A + B) + C 1

For multiplication, the associative law states: When ANDing more than two variables, the result is the same regardless of the grouping of the variables. A(BC) = (AB)C Distributive Law: The distributive law is the factoring law. A common variable can be factored from an expression just as in ordinary algebra. That is: AB + AC = A(B+ C) 2

Rules of Boolean Algebra Rule 1: A + 0 = A, a variable ORed with 0 is always equal to the variable. Rule 2: A + 1 = 1, a variable ORed with 1 is always equal to 1. Rule 3: A. 0 = 0, a variable ANDed with 0 is always equal to 0. Rule 4: A. 1 = A, a variable ANDed with 1 is always equal to the variable. 3

Rule 5: A + A = A, a variable ORed with itself is always equal to the variable. Rule 6: A + A = 1, a variable ORed with its complement is always equal to 1. Rule 7: A. A = A, a variable ANDed with itself is always equal to the variable. 4

Rule 8: A. A = 0, a variable ANDed with its complement is always equal to 0. Rule 9: A = A, the double complement of a variable is always equal to the variable. Rule 10: A + AB = A, this rule can be proved as follows: A+AB= A (1+B) Factoring (distributive low) = A.1 Rule2: (1+B) = 1 = A Rule4: A. 1 = A Rule 11: A + A B = A + B, this rule can be proved as follows: A + A B = (A +AB) + A B Rule10 (A=A+AB) = (AA+AB) + A B Rule7: A = AA = AA + AB +AA +AB Rule8: adding AA = 0 = (A+A ) (A+B) Factoring = 1. (A+B) Rule6: A+A =1 5

= A+ B Rule4: 1. X = X Rule 12: (A + B)(A + C) = A + BC, this rule can be proved as follows: (A + B)(A + C) = AA + AC + AB + BC Distributive low = A + AC + AB + BC Rule7: AA = A = A (1+C) + AB + BC Factoring = A.1 + AB + BC Rule2: 1+C = 1 = A (1 + B) + BC Factoring = A.1 +BC Rule2: 1+B = 1 = A + BC Rule4: A.1 = A DeMorgan s Theorems 1 st Theorem: The complement of a product of variables is equal to the sum of the complemented variables. (XY) = X + Y 2 st Theorem: The complement of a sum of variables is equal to the product of the complemented variables. (X + Y) = X. Y 6

Example: Apply DeMorgan s theorem to remove the overbar covering both terms from the expression X = (C + D) Solution: To apply DeMorgan s theorem to the expression, you can break the overbar covering both terms and change the sign between the terms. This results in: X = C. D Deleting the double bar gives X = C. D 7