Boolean Algebra and Logic Gates

Slides:



Advertisements
Similar presentations
Boolean Algebra and Logic Gates
Advertisements

Princess Sumaya University
Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR
CS 151 Digital Systems Design Lecture 5 Boolean Algebra.
Boolean Algebra and Logic Gates
Princess Sumaya University
Types of Logic Circuits
Logical Systems Synthesis.
Chapter 2 Logic Circuits.
Chapter 2 – Combinational Logic Circuits Part 1 – Gate Circuits and Boolean Equations Logic and Computer Design Fundamentals.
1 COMP541 Combinational Logic Montek Singh Jan 16, 2007.
Boolean Algebra and Logic Gates
Boolean Algebra and Logic Gates1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Chapter Two Boolean Algebra and Logic Gate
Chapter 2: Boolean Algebra and Logic Functions
Gate Circuits and Boolean Equations BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.
Mantıksal Tasarım – BBM231 M. Önder Efe
Chapter 2 Boolean Algebra and Logic Gates
Boolean Algebra Boolean algebra Boolean algebra, like any other deductive mathematical system, may be defined with –a set of elements, –a set of operators,
2-6 Other Logic Operations For two variables one can achieve sixteen operations Only eight are useful for computers Boolean algebra built on AND, OR and.
Logic Design CS221 1 st Term Boolean Algebra Cairo University Faculty of Computers and Information.
1 Why study Boolean Algebra? 4 It is highly desirable to find the simplest circuit implementation (logic) with the smallest number of gates or wires. We.
Boolean Algebra and Logic Gates CE 40 B 18 June 2003.
1 Logic Gates Digital Computer Logic Kashif Bashir WWW:
Chapter 2 Boolean Algebra and Logic Gates 授課教師 : 張傳育 博士 (Chuan-Yu Chang Ph.D.) Tel: (05) ext.
Combinational Logic 1.
Chapter 2. Outlines 2.1 Introduction 2.2 Basic Definitions 2.3 Axiomatic Definition of Boolean Algebra 2.4 Basic thermos and proprieties of Boolean Algebra.
Module 4.  Boolean Algebra is used to simplify the design of digital logic circuits.  The design simplification are based on: Postulates of Boolean.
Logic Design Dr. Yosry A. Azzam.
Overview Part 1 – Gate Circuits and Boolean Equations
Digital System Ch2-1 Chapter 2 Boolean Algebra and Logic Gates Ping-Liang Lai ( 賴秉樑 ) Digital System 數位系統.
Boolean Algebra and Logic Gates
CHAPTER 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs
A. Abhari CPS2131 Chapter 2: Boolean Algebra and Logic Gates Topics in this Chapter: Boolean Algebra Boolean Functions Boolean Function Simplification.
1 Lect # 2 Boolean Algebra and Logic Gates Boolean algebra defines rules for manipulating symbolic binary logic expressions. –a symbolic binary logic expression.
Logic Circuits Lecture 3 By Amr Al-Awamry. Basic Definitions Binary Operators  AND z = x y = x yz=1 if x=1 AND y=1  OR z = x + y z=1 if x=1 OR y=1 
1 COMP541 Combinational Logic - II Montek Singh Jan 18, 2012.
Binary Logic and Gates Boolean Algebra Canonical and Standard Forms Chapter 2: Boolean Algebra and Logic Gates.
R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 9 Boolean Algebras and Combinatorial Circuits.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 4 Dr. Shi Dept. of Electrical and Computer Engineering.
ECE DIGITAL LOGIC LECTURE 8: BOOLEAN FUNCTIONS Assistant Prof. Fareena Saqib Florida Institute of Technology Spring 2016, 02/11/2016.
ECE DIGITAL LOGIC LECTURE 6: BOOLEAN ALGEBRA Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2016, 02/01/2016.
Logic Design (CE1111 ) Lecture 2 (Chapter 2) Prepared by Dr. Lamiaa Elshenawy 1.
CSE 461. Binary Logic Binary logic consists of binary variables and logical operations. Variables are designated by letters such as A, B, C, x, y, z etc.
Fuw-Yi Yang1 數位系統 Digital Systems Department of Computer Science and Information Engineering, Chaoyang University of Technology 朝陽科技大學資工系 Speaker: Fuw-Yi.
CHAPTER 2 Boolean algebra and Logic gates
Digital Logic Circuits, Digital Component and Data Representation Course: BCA-2 nd Sem Subject: Computer Organization And Architecture Unit-1 1.
Chapter 2: Boolean Algebra and Logic Functions
ECE 2110: Introduction to Digital Systems
Unit 2 Boolean Algebra.
ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2 Instructor: Andrew B. Kahng (lecture)
CS 105 Digital Logic Design
ECE 3110: Introduction to Digital Systems
Gate Circuits and Boolean Equations
CHAPTER 2 Boolean Algebra
Overview Part 1 – Gate Circuits and Boolean Equations
Princess Sumaya University
TN 221: DIGITAL ELECTRONICS 1
Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也
ECE/CS 352 Digital Systems Fundamentals
CHAPTER 2 Boolean Algebra
Boolean Algebra Why study Boolean Algebra?
Boolean Algebra.
INTRODUCTION TO LOGIC DESIGN Chapter 2 Boolean Algebra and Logic Gates
Boolean Algebra.
Chapter 2 Boolean Algebra and Logic Gate
2. Boolean Algebra and Logic Gates
Chapter 2 Introduction to Logic Circuits
Digital Logic Chapter-2
Digital Logic Chapter-2
Presentation transcript:

Boolean Algebra and Logic Gates Chapter 2

Basic Definitions Boolean Algebra defined with a set of elements, a set of operators and a number of axioms or postulates. A set if a collection of objects having a common property Elements x is an element of set S y is not an element of set S * Binary operator and result c of operation on a and b is an element of set S

Basic Definitions Closure: A set S is closed with respect to a binary operator if, for every pair of elements of S, the binary operator specifies a rula for obtaining a unique element of S. Associative law: (x*y)*z=x*(y*z) for all z, y, z ЄS. Commutative law: x*y=y*x Identity Element: e*x=x*e=x Inverse: A set S having the identity element e with respect to binary operator * is said to have an inverse whenever, for every xЄS, there exists an element y such that x*y=e Distributive law: If * and . are binary operators on S, * is said to be distributive over . whenever x*(y.z)=(x*y).(x*z)

Basic Definitions A field is an example of an algebraic structure. A field is a set of elements, together with two binary operators, each having properties 1-5 and both combining to give property 6.

Axiomatic Definition of Boolean Algebra Boolean algebra is an algebraic structure defined by a set of elements, B, together with binary operators + and . (a) The structure is closed with respect to + (b) The structure is closed with respect to . (a) The element 0 is an identity element with respect to + (b) The element 1 is an identity element with respect to . (a) The structure is commutative with respect to + (b) The structure is commutative with respect to . (a) The operator . is distributive over + (b) The operator + is distributive over . For every element xЄB, there exists an element x’ЄB called the complement of x such that (a) x+x’=1 and (b) x.x’=0 There exist at least two elements x, yЄB such that x≠y

Two-valued Boolean Algebra Defined on a set of two elements x y x.y 1 x y x+y 1 x x’ 1

Two-valued Boolean Algebra x y z 1 y+z x.(y+z) 1 x.y x.z (x.y)+(x.z) 1

Basic Theorems and Property of Boolean Algebra Duality: Exchange parts (a) and (b) of Boolean Algebra (operators and identity element) and postulates remain valid In two valued Boolean Algebra identity elements of set B are the same: 1 and 0; interchange 1’s by 0’s and 0’s by 1’s and interchange OR and AND operators.

Basic Theorems

Theorem 1(a) but thus Distributing + over . gives in general Replace x by x’

Theorem 1(b) It can be proved by duality of Theorem 1(a)

Theorem 2(a)

By duality of Theorem 2(a) Theorem 2(b) By duality of Theorem 2(a)

Theorem 3 and Both equations define the complement The complement of is and is also Since the complement is unique

Theorem 6(a) Absortion

By duality of Theorem 6(a) Theorem 6(b) Absortion By duality of Theorem 6(a)

Theorem 6(a) Absortion Proof by truth table x y 1 xy x+xy 1

DeMorgan’s Theorem Proof by truth table x y x+y (x+y)’ 1 x' y' x‘y’ 1

Operator precedence Parenthesis NOT AND OR

Boolean Functions A Boolean functions described by an algebraic expression consists of binary variables, the binary constants 0 and 1, and the logic operation symbols Do the truth tables for these functions

Boolean functions

Boolean Functions

Boolean functions Transform the algebraic equation of F1 to a circuit diagram using logic gates

Boolean functions Transform the algebraic equation of F2 to a circuit diagram using logic gates

Boolean functions Algebraic manipulation can yield smaller (simpler) expressions, and a smaller implementation (lower cost)

Boolean functions

Boolean functions Compare the two implementations

Algebraic manipulation Example 1 Example 2 Example 3

Algebraic manipulation Example 4 By duality of Example 4 Example 5

Complement of a function Generalization of DeMorgan’s theorems

Complement of a function Find the complement of the following functions

Complement of a function Find the complement of the following functions by taking their duals and complementing each literal The dual Complement each literal The dual Complement each literal

Canonical and Standard Form

Minterms and maxterms Minterm or standard product: product of variables or their complement (all) in Boolean function. If n variables 2n possible combinations. Obtained from truth table of function

Minterms and maxterms Example of two Boolean functions on truth table

Minterms From truth table

Maxterms Complementing function and applying DeMorgan’s Theorem Complement applying DeMorgan’s

Maxterms Complementing function and applying DeMorgan’s Theorem Complement applying DeMorgan’s

Example 2.4

Conversion between canonical forms Complement function Complement using DeMorgan’s Theorem

Conversion between canonical forms Interchange the symbols Σ and Π List the numbers missing from the original form (remember there are 2n minterms of maxterms , where n is the number of binary variables in the function)

Conversion between canonical forms

Standard Forms Sum of products (not canonical necessarily) Product of sums (not canonical necessarily)

Standard forms Obtain from diagram the standard forms

Use distributive law to remove parenthesis Standard forms Three- and two-level implementations Use distributive law to remove parenthesis

Other logic operations

Other Logic Operations

Digital Logic Gates

Extension to multiple inputs NOT: only one input OR: commutative and associative, thus no problem AND: commutative and associative, thus no problem NAND: commutative but not associative! NOR: commutative but not associative!

Extension to multiple inputs NOR gate NAND gate

Extension to multiple inputs

Extension to multiple inputs

Extension to multiple inputs

Positive and Negative Logic

Positive and Negative Logic

Integrated Circuits Small-Scale Integration (SSI): fewer than 10 gates per chip Medium-Scale Integration (MSI): 10 to 1000 gates per chip Large-Scale Integration (LSI): Several thousands of gates per chip Very Large-Scale Integrations (VLSI): hundreds of thousands of gates per chip

Digital logic families TTL: Transistor-Transistor Logic ECL: Emitter-Coupled Logic MOS: Metal-Oxide Semiconductor CMOS: Complementary Metal-Oxide Semiconductor

Computer-Aided Design Hardware Description Language (HDL) Tools to simulate, verify functionality, and automatically and optimally synthesize the logic described in HDL IEEE approved HDL standards: Verilog HDL VHDL

Homework Assignment 2.1 2.2 2.5 2.9 2.10 2.12 2.14 2.18 2.20 2.28

Homework Assignment (Bonus) Obtain the datasheet for the CD4001 CMOS Quad two-input NOR Gates and explain in your own words the data in the Static Electrical Characteristics, Recommended Operating Conditions and the Dynamic Electrical Characteristics You can work in groups and turn your bonus assignment in one per group, but to obtain the bonus (5 points for your first test) you must answer one question about the datasheet in your test.