EE365 Boolean algebra Combinational-circuit analysis.

Slides:

Advertisements

Similar presentations

Boolean Algebra and Logic Gates

Advertisements

Sistemas Digitais I LESI - 2º ano Lesson 3 - Boolean Algebra U NIVERSIDADE DO M INHO E SCOLA DE E NGENHARIA Prof. João Miguel Fernandes

Lecture 5 EGRE 254 1/28/09. 2 Boolean algebra a.k.a. “switching algebra” –deals with Boolean values -- 0, 1 Positive-logic convention –analog voltages.

Types of Logic Circuits

Logical Systems Synthesis.

ECE 2110: Introduction to Digital Systems Combinational Logic Design Principles.

Chapter 2 Logic Circuits.

Morgan Kaufmann Publishers

CS 151 Digital Systems Design Lecture 6 More Boolean Algebra A B.

1 COMP541 Combinational Logic Montek Singh Jan 16, 2007.

EECC341 - Shaaban #1 Lec # 5 Winter Switching Algebra: Principle of Duality Any theorem or identity in switching algebra remains true if.

COMBINATIONAL LOGIC CIRCUITS C.L. x1 x2 xn Z Z = F (x1, x2, ……., Xn) F is a Binary Logic (BOOLEAN ) Function Knowing F Allows Straight Forward Direct Implementation.

EE365 Adv. Digital Circuit Design Clarkson University Lecture #2 Boolean Laws and Methods.

Boolean Algebra and Logic Gates1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.

Logic Functions and their Representation. Slide 2 Combinational Networks x1x1 x2x2 xnxn f.

Modified from John Wakerly Lecture #2 and #3 CMOS gates at the transistor level Boolean algebra Combinational-circuit analysis.

Combinational Digital Circuits. Measurement Our world is an analog world. Measurements that we make of the physical objects around us are never in discrete.

Boolean Algebra and Logic Simplification. Boolean Addition & Multiplication Boolean Addition performed by OR gate Sum Term describes Boolean Addition.

Boolean Algebra Computer Organization 1 © McQuain Boolean Algebra A Boolean algebra is a set B of values together with: -two binary operations,

Logical Circuit Design

Boolean Algebra Boolean algebra Boolean algebra, like any other deductive mathematical system, may be defined with –a set of elements, –a set of operators,

CHAPTER 2 Boolean Algebra

Switching functions The postulates and sets of Boolean logic are presented in generic terms without the elements of K being specified In EE we need to.

ECE 331 – Digital System Design

Combinational Logic 1.

Boolean Algebra 1854, George Boole created a two valued algebraic system which is now called Boolean algebra. 1938, Claude Shannon adapted Boolean algebra.

1 ENGR 254 Lecture DeMorgan Symbol Equivalence.

Chapter 4 Combinational Logic Design Principles. Overview Objectives -Define combinational logic circuit -Analysis of logic circuits (to describe what.

1 Boolean Algebra  Digital circuits Digital circuits  Boolean Algebra Boolean Algebra  Two-Valued Boolean Algebra Two-Valued Boolean Algebra  Boolean.

--- outputs logical functions of inputs --- new outputs appear shortly after changed inputs (propagation delay) --- no feedback loops --- no clock Sequential.

ENGIN112 L6: More Boolean Algebra September 15, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra A B.

1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.

CHAPTER 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs

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.

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 

ECE 3110: Introduction to Digital Systems Chapter #4 Review.

Digital Design: Principles and Practices Chapter 4 Combinational Logic Design Principles.

Lecture 3 Combinational Circuits

Boolean Functions and Boolean Algebra Laxmikant Kale.

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 4 Dr. Shi Dept. of Electrical and Computer Engineering.

KU College of Engineering Elec 204: Digital Systems Design 1 Review D: n bit binary number D = (d n-1 ∙ ∙ ∙ d 1 d 0 ) 2 If D is an unsigned binary number.

ECE 2110: Introduction to Digital Systems

Lecture 5 More Boolean Algebra A B. Overview °Expressing Boolean functions °Relationships between algebraic equations, symbols, and truth tables °Simplification.

CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. De Morgan’s Theorem De Morgan’s Theorem.

DE MORGAN’S THEOREM. De Morgan’s Theorem De Morgan’s Theorem.

Lecture 3 Boolean algebra Topics Error Correcting Codes Boolean algebra Combinational circuits Algebraic analysis, Truth tables, Logic Diagrams Sums-of-Products.

Boolean or, Switching Algebra. Switching Algebra The two-valued Boolean algebra is also called “Switching algebra” by engineers and computer scientists.

CHAPTER 2 Boolean algebra and Logic gates

Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. 1 Boolean Algebra (continued) UNIT 3.

De Morgan’s Theorem,.

14:332:231 DIGITAL LOGIC DESIGN Boolean Algebra

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)

Logic Gates and Boolean Algebra

CS 105 Digital Logic Design

ECE 3110: Introduction to Digital Systems

Gate Circuits and Boolean Equations

CHAPTER 2 Boolean Algebra

CHAPTER 2 Boolean Algebra This chapter in the book includes:

Overview Part 1 – Gate Circuits and Boolean Equations

Speaker: Fuw-Yi Yang 楊伏夷伏夷非征番, 道德經察政章(Chapter 58) 伏者潛藏也

Modified from John Wakerly Lecture #2 and #3

Boolean Algebra.

Functions Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: We can represent.

Digital Systems Design

EE121 John Wakerly Lecture #3

From now on: Combinatorial Circuits:

Chapter 4 Combinational Logic Design Principles. Overview Objectives -Define combinational logic circuit -Analysis of logic circuits (to describe what.

Presentation transcript:

EE365 Boolean algebra Combinational-circuit analysis

Boolean algebra a.k.a. “switching algebra” –deals with boolean values -- 0, 1 Positive-logic convention –analog voltages LOW, HIGH --> 0, 1 Negative logic -- seldom used Signal values denoted by variables (X, Y, FRED, etc.)

Boolean operators Complement:X (opposite of X) AND:X  Y OR:X + Y Axiomatic definition: A1-A5, A1-A5 binary operators, described functionally by truth table.

More definitions Literal: a variable or its complement –X, X, FRED, CS_L Expression: literals combined by AND, OR, parentheses, complementation –X+Y –P  Q  R –A + B  C –((FRED  Z) + CS_L  A  B  C + Q5)  RESET Equation: Variable = expression –P = ((FRED  Z) + CS_L  A  B  C + Q5)  RESET

Logic symbols

Theorems Proofs by perfect induction

More Theorems N.B. T8, T10, T11

Duality Swap 0 & 1, AND & OR –Result: Theorems still true Why? –Each axiom (A1-A5) has a dual (A1-A5  Counterexample: X + X  Y = X (T9) X  X + Y = X (dual) X + Y = X (T3) ???????????? X + (X  Y) = X (T9) X  (X + Y) = X (dual) (X  X) + (X  Y) = X (T8) X + (X  Y) = X (T3) parentheses, operator precedence!

N-variable Theorems Prove using finite induction Most important: DeMorgan theorems

DeMorgan Symbol Equivalence

Likewise for OR (be sure to check errata!)

DeMorgan Symbols

Even more definitions (Sec ) Product term Sum-of-products expression Sum term Product-of-sums expression Normal term Minterm (n variables) Maxterm (n variables)

Truth table vs. minterms & maxterms

Combinational analysis

Signal expressions Multiply out: F = ((X + Y)  Z) + (X  Y  Z) = (X  Z) + (Y  Z) + (X  Y  Z)

New circuit, same function

“Add out” logic function Circuit:

Shortcut: Symbol substitution

Different circuit, same function

Another example