Boolean Algebra Computer Architecture. Digital Representation Digital is an abstraction of analog voltage –Voltage is a continuous, physical unit Typically.

Slides:



Advertisements
Similar presentations
CT455: Computer Organization Logic gate
Advertisements

Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR
CS 151 Digital Systems Design Lecture 5 Boolean Algebra.
Chapter 2 Logic Circuits.
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.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 3 Dr. Shi Dept. of Electrical and Computer Engineering.
1 COMP541 Combinational Logic Montek Singh Jan 16, 2007.
1 Boolean Algebra & Logic Design. 2 Developed by George Boole in the 1850s Mathematical theory of logic. Shannon was the first to use Boolean Algebra.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
ENGIN112 L5: Boolean Algebra September 12, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 5 Boolean Algebra.
Propositional Calculus Math Foundations of Computer Science.
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.
Boolean Algebra Computer Organization 1 © McQuain Boolean Algebra A Boolean algebra is a set B of values together with: -two binary operations,
Digital Logic Circuits – Chapter 1 Section 1-3, 1-2.
Module 3.  Binary logic consists of :  logic variables  designated by alphabet letters, e.g. A, B, C… x, y, z, etc.  have ONLY 2 possible values:
1 CHAPTER 4: PART I ARITHMETIC FOR COMPUTERS. 2 The MIPS ALU We’ll be working with the MIPS instruction set architecture –similar to other architectures.
Systems Architecture I1 Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus so that they.
Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.
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.
Digital Electronics. Introduction to Number Systems & Codes Digital & Analog systems, Numerical representation, Digital number systems, Binary to Decimal.
SUPLEMENTARY CHAPTER 1: An Introduction to Digital Logic The Architecture of Computer Hardware and Systems Software: An Information Technology Approach.
Boolean Algebra and Digital Circuits
Fall 2012: FCM 708 Foundation I Lecture 2 Prof. Shamik Sengupta
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.
Computer Science 210 Computer Organization Introduction to Boolean Algebra.
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /05/2013 Lecture 4: Basics of Logic Design Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER.
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.
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)
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.
Digital Logic. 2 Abstractions in CS (gates) Basic Gate: Inverter IO IO GNDI O Vcc Resister (limits conductivity) Truth Table.
LOGIC GATES & BOOLEAN ALGEBRA
1 Lecture 6 BOOLEAN ALGEBRA and GATES Building a 32 bit processor PH 3: B.1-B.5.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI Dale Roberts, Lecturer Computer Science, IUPUI
Lecture 4 Boolean Algebra. Logical Statements °A proposition that may or may not be true: Today is Monday Today is Sunday It is raining °Compound Statements.
Chapter-3: BOOLEAN ALGEBRA & LOGIC GATES Analysis and logical design.
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.
Module 7.  In Module 3 we have learned about NAND gate – it is a combination of AND operation followed by NOT operation  Symbol A. B = Y  Logic Gate.
ECE DIGITAL LOGIC LECTURE 6: BOOLEAN ALGEBRA Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2016, 02/01/2016.
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
NAND, NOR, and EXOR (more primitive logical gates) CS Computer Architecture David Mayer.
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.
Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 
Hoda Roodaki Boolean Algebra Hoda Roodaki
Logic gates.
Computer Architecture & Operations I
Computer Architecture & Operations I
Boolean Algebra & Logic Gates
Morgan Kaufmann Publishers
Introductory Lecture on Digital Electronics
Logic Gates and Boolean Algebra
Computer Science 210 Computer Organization
De Morgan’s Theorem,.
Boolean Algebra.
Logic Gates and Boolean Algebra
Logic Gates.
Boolean Algebra A Boolean algebra is a set B of values together with:
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
Basic Logic Gates 1.
Digital Logic.
Boolean Algebra Introduction CSCI 240
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION Part (a)
Presentation transcript:

Boolean Algebra Computer Architecture

Digital Representation Digital is an abstraction of analog voltage –Voltage is a continuous, physical unit Typically ranging from 0 to 5 volts on PCs –Digital logic abstracts it to 2 distinct levels –“1” or positive (typically 2.5 V or greater) –“0” or negative (typically less than 1 volt) Eases design and manufacturing –Provides more immunity from noise Analog Voltage WaveformDigital Voltage Waveform V 0V

Digital Processing Combine “1”s and “0”s in different ways –To generate more “1”s and “0”s This is finally what a computer really does Need a well defined mechanism Ease design & development of circuits –Boolean Algebra Mathematical framework for processing “1”s & “0”s Based on simple, scalable primitive operations –Easy to realize using basic hardware components Scales to reason about complex operations Leads to information processing –When combined with suitable interpretations

Axioms of Boolean Algebra Two Boolean constants –“1” or “true” –“0” or “false” Boolean variables –An unknown Boolean value Can be “1” or “0” (but not both at the same time) –Represented using symbols (or alphabets) Examples: “X”, “A”, “B”, “  ”, “  ” 3 primary Operators –NOT (unary operator) –AND (Binary operator) –OR (Binary operator)

Truth Table Tabulates results of operators –Involves n variables –Consists of 2 n rows Each row has a unique combination of “1” and “0” for the n variables –Used to define result of primary operators NOT, AND, & OR

NOT Operator NOT operator inverts the value of a variable –Given a Boolean variable A –NOT operation is represented as A NOT is described by the following truth table: AA 01 10

AND Operator AND operator –Binary operator: Uses 2 operands –Result is a “1” only if both operands are “1” –AND operation is represented as AB or AB Where A and B are two Boolean variables AND is described by the following truth table: AB ABAB

OR Operator OR operator –Binary operator: Uses 2 operands –Result is a “1” if any one of the operand is a “1” –OR operation is represented as A+B Where A and B are two Boolean variables OR is described by the following truth table: ABA+B

Exercises If A=1 and B=0, What is –A = –A+B = –AB = –AA = –B+B = –A =

Boolean Equation Combination of operands & operators –Examples 1 A+A (A+B)1 (A0)+(B0) A+B+C+D A1+B1 –Operator precedence Inner most parentheses NOT AND OR

Boolean Equations & Truth Tables Illustrate Truth Table for A+BC ABCBCA+BC

Laws of Boolean Algebra For a Boolean variable A –Identity law A + 0 = A A 1 = A –Zero and One laws A + 1 = 1 A 0 = 0 –Inverse laws A + A = 1 A A = 0

Laws of Boolean Algebra (Contd.) Given Boolean variables A, B, & C –Commutative laws A + B = B + A A B = B A –Associative laws A + (B + C) = (A + B) + C A (B C) = (A B) C –Distributive laws A (B + C) = (A B) + (A C) A+(B C) = (A+B) (A+C) –DeMorgan’s laws (A B) = A + B (A+B) = A B

Verification of Laws (1) Using Truth Tables –Identity Law A + 0 = A AA

Verification of Laws (2) –Distributive law A (B + C) = (A B) + (B C) ABCA(B+C) (A B)+(B C)

More Boolean Operators Other commonly used Boolean Operators Convenient when implementing logic operations using electronic components –NAND (AB) –NOR (A+B)

English to Logic Conversion Straightforward strategy Use common sense –Identify independent clauses Look for “and” & “or” clauses in sentences –Identify primary inputs –Work logic out for each independent clause –Connect them back together –Optimize the final equation We will not deal with optimizations in this course –Verify using Truth Table

Example 1 Output is 1 only if the two primary inputs are zero –Let the primary inputs be A and B –Output is 1 in the following cases A=0 & B=0 => A B –The above equation can be rewritten as: (A+B)

Example 2 Output is 1 only if the two primary inputs are different –Let the inputs be A and B –Output is 1 in the following cases A=1, B=0 => AB A=0, B=1 => AB –Combining the above two cases gives: (AB)+(AB) This operation is called Exclusive-OR or XOR –It is frequently used –Represented as A + B

Truth Table for XOR XOR is a frequently used operation –It is important to remember its operation ABA+B