1 ENGR 254 Lecture 6 2-2-09 2 DeMorgan Symbol Equivalence.

Slides:



Advertisements
Similar presentations
Morgan Kaufmann Publishers
Advertisements

ECE 3110: Introduction to Digital Systems Simplifying Sum of Products using Karnaugh Maps.
ECE 301 – Digital Electronics Minterm and Maxterm Expansions and Incompletely Specified Functions (Lecture #6) The slides included herein were taken from.
ECE 331 – Digital System Design
Logic Gate Level Part 2. Constructing Boolean expression from truth table First method: write nonparenthesized OR of ANDs Each AND is a 1 in the result.
CS 151 Digital Systems Design Lecture 11 NAND and XOR Implementations.
Basic Digital Design Discussion D5.4 Section 13.6.
EE365 Boolean algebra Combinational-circuit analysis.
CS 151 Digital Systems Design Lecture 6 More Boolean Algebra A B.
1 EE 365 Combinational-Circuit Synthesis. 2 Combinational-Circuit Analysis Combinational circuits -- outputs depend only on current inputs (not on history).
ENGIN112 L11: NAND and XOR Implementation September 26, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 11 NAND and XOR Implementations.
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.
Basic Digital Design Discussion D5.4 Appendix F. Basic Digital Design Sum-of-Products Design Product-of-Sums Design.
EE365 Adv. Digital Circuit Design Clarkson University Lecture #2 Boolean Laws and Methods.
Example: Given a 4-bit input combination N=N 3 N 2 N 1 N 0, this function produces a 1 output for N=1,2,3,5,7,11,13, and 0 otherwise.  According to the.
ECE 331 – Digital System Design Multi-level Logic Circuits and NAND-NAND and NOR-NOR Circuits (Lecture #8) The slides included herein were taken from the.
Boolean Algebra and Logic Gates1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
ENEE244-02xx Digital Logic Design Lecture 10. Announcements HW4 assigned, due 10/9.
1 EECC341 - Shaaban #1 Lec # 6 Winter Combinational Circuit Analysis Example Given this logic circuit we can : Find corresponding logic.
Modified from John Wakerly Lecture #2 and #3 CMOS gates at the transistor level Boolean algebra Combinational-circuit analysis.
2.7 NAND and NOR logic networks
Boolean Algebra and Logic Simplification. Boolean Addition & Multiplication Boolean Addition performed by OR gate Sum Term describes Boolean Addition.
Digital Logic Design Adil Waheed. BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION AND gate F = A.B OR gate F = A + B NOT gate F = A NAND gate F = A.B NOR gate.
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
KU College of Engineering Elec 204: Digital Systems Design
Lecture 4 Logic gates and truth tables Implementing logic functions
BOOLEAN ALGEBRA Saras M. Srivastava PGT (Computer Science)
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
 Seattle Pacific University EE Logic System DesignSOP-POS-1 The Connection: Truth Tables to Functions abcF abcF
1 EE121 John Wakerly Lecture #4 Combinational-Circuit Synthesis ABEL.
Combinational Logic 1.
ECE 2110: Introduction to Digital Systems PoS minimization Don’t care conditions.
Boolean Algebra Combinational-Circuit Analysis We analyze a combinational logic circuit by obtaining a formal description of its logic function. Once.
Chapter 4 Combinational Logic Design Principles. Overview Objectives -Define combinational logic circuit -Analysis of logic circuits (to describe what.
Circuit Minimization. It is often uneconomical to realize a logic directly from the first logic expression that pops into your head. Canonical sum and.
NAND-NAND and NOR-NOR Circuits and Even and Odd Logic Functions
Venn Diagram – the visual aid in verifying theorems and properties 1 E.
ECE 3110: Introduction to Digital Systems Combinational-Circuit Synthesis.
ECE 3110: Introduction to Digital Systems
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
Fundamentals of digital electronics Prepared by - Anuradha Tandon Assistant Professor, Instrumentation & Control Engineering Branch, IT, NU.
ECE 3110: Introduction to Digital Systems Chapter #4 Review.
Digital Design: Principles and Practices Chapter 4 Combinational Logic Design Principles.
CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.
ECE DIGITAL LOGIC LECTURE 8: BOOLEAN FUNCTIONS Assistant Prof. Fareena Saqib Florida Institute of Technology Spring 2016, 02/11/2016.
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
Lecture 5 More Boolean Algebra A B. Overview °Expressing Boolean functions °Relationships between algebraic equations, symbols, and truth tables °Simplification.
DeMorgan’s Theorem DeMorgan’s 2 nd Theorem The complement of a sum of variables is equal to the product of the complemented variables. A + B = A. B Applying.
CEC 220 Digital Circuit Design Minterms and Maxterms Monday, January 26 CEC 220 Digital Circuit Design Slide 1 of 11.
Boolean or, Switching Algebra. Switching Algebra The two-valued Boolean algebra is also called “Switching algebra” by engineers and computer scientists.
Digital Systems Design 1 Signal Expressions Multiply out: F = ((X + Y)  Z) + (X  Y  Z) = (X  Z) + (Y  Z) + (X  Y  Z)
Boolean Algebra and Logic Gates COE 202 Digital Logic Design Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals.
ECE 2110: Introduction to Digital Systems
ECE 2110: Introduction to Digital Systems
ECE 2110: Introduction to Digital Systems
CS 105 Digital Logic Design
CHAPTER 2 Boolean Algebra
Boolean Expressions Lecture No. 10.
ECE 2110: Introduction to Digital Systems
ECE 331 – Digital System Design
Modified from John Wakerly Lecture #2 and #3
Digital Systems Design
COMP541 Combinational Logic - II
Lecture 5 Logistics Last lecture Today’s lecture
EE121 John Wakerly Lecture #3
Presentation transcript:

1 ENGR 254 Lecture

2 DeMorgan Symbol Equivalence

3 Likewise for OR (be sure to check errata!) FIG 4-4

4 DeMorgan Symbols

5 Definitions (Sec ) Literal – A variable or the complement of a variable. Example X, Y, Y’, etc. Product term – A single literal or product of literals. Example: Sum-of-products expression – A logical sum of product terms. Example: Sum term – A single literal of sum of literals. Example: Product-of-sums expression – A logical product of sum terms. Example:

6 Definitions Normal term – A product or sum term in which no variable appears more than once. –Example non-normal: –Example normal: Minterm (n variables) – A normal product term with n literals. Example: Maxterm (n variables) – A normal sum term with n literals. Example:

7 Truth table vs. minterms & maxterms

8 Combinational analysis XYZF

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

10 New circuit, same function F = X  Z + Y  Z + X  Y  Z

11 “Add out” logic function Circuit:

12 Shortcut: Symbol substitution

13 Different circuit, same function

14 Another example

15 Sum-of-products form AND-OR NAND-NAND

16 Product-of-sums form OR-AND NOR-NOR P-of-S preferred in CMOS, TTL (NAND-NAND)

17 Brute-force design Truth table --> canonical sum (sum of minterms) Example: prime-number detector –4-bit input, N 3 N 2 N 1 N 0 row N 3 N 2 N 1 N 0 F F(N 3, N 2, N 1, N 0 ) =   (1,2,3,5,7,11,13)

18 Minterm list --> canonical sum

19 Algebraic simplification Theorem T8, Reduce number of gates and gate inputs

20 Resulting circuit