Lecture 7 Logic Simplification

Similar documents
EEE130 Digital Electronics I Lecture #4_1

Boolean Analysis of Logic Circuits

Digital Logic Design (3)

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

Digital Fundamentals

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

2/8/2017. SOP Form Gives Good Performance. ECE 120: Introduction to Computing. K-Maps Can Identify Single-Gate Functions

Summary. Boolean Addition

IT 201 Digital System Design Module II Notes

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

DKT 122/3 DIGITAL SYSTEM 1

Digital Circuits ECS 371

Chapter 2. Boolean Expressions:

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

2B 52 AB CA 3E A1 +29 A B C. CS120 Fall 2018 Final Prep and super secret quiz 9

2.6 BOOLEAN FUNCTIONS

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

Objectives: 1. Design procedure. 2. Fundamental circuits. 1. Design procedure

Combinational Logic Circuits

Chapter 3. Boolean Algebra and Digital Logic

Identity. p ^ T p p _ F p. Idempotency. p _ p p p ^ p p. Associativity. (p _ q) _ r p _ (q _ r) (p ^ q) ^ r p ^ (q ^ r) Absorption

There are only 16 possible 2-input gates Let s examine all of them. Some we already know, others are just silly.

CprE 281: Digital Logic

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

PART 1. Simplification Using Boolean Algebra

Chapter 2 Part 4 Combinational Logic Circuits

ENGIN 112 Intro to Electrical and Computer Engineering

Logic Design (Part 2) Combinational Logic Circuits (Chapter 3)

4 KARNAUGH MAP MINIMIZATION

Section 001. Read this before starting! You may use one sheet of scrap paper that you will turn in with your test.

University of Technology

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

Experiment 3: Logic Simplification

Learning Objectives: Topic Karnaugh Maps. At the end of this topic you will be able to;

Switching Circuits & Logic Design

9/10/2016. ECE 120: Introduction to Computing. The Domain of a Boolean Function is a Hypercube. List All Implicants for One Variable A

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

Gate-Level Minimization. BME208 Logic Circuits Yalçın İŞLER

At this point in our study of digital circuits, we have two methods for representing combinational logic: schematics and truth tables.

Chapter 2: Combinational Systems

Digital Logic Lecture 7 Gate Level Minimization

Review: Standard forms of expressions

ENEL Digital Circuits Midterm Examination

Standard Forms of Expression. Minterms and Maxterms

Lecture 5. Chapter 2: Sections 4-7

Digital Logic Design. Midterm #1

A graphical method of simplifying logic

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

Ch. 5 : Boolean Algebra &

Graduate Institute of Electronics Engineering, NTU. CH5 Karnaugh Maps. Lecturer: 吳安宇教授 Date:2006/10/20 ACCESS IC LAB

Chapter 2 Combinational Logic Circuits

Lecture 6: Signed Numbers & Arithmetic Circuits. BCD (Binary Coded Decimal) Points Addressed in this Lecture

Parallel logic circuits

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

ELCT201: DIGITAL LOGIC DESIGN

Solutions for 3824 Midterm Exam 3/4/ Truth table. A B C Z

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

Date Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 04. Boolean Expression Simplification and Implementation

Introduction to Microprocessors and Digital Logic (ME262) Boolean Algebra and Logic Equations. Spring 2011

UNIT 2 BOOLEAN ALGEBRA

Simplification of two-level combinational logic

ENGIN 112. Intro to Electrical and Computer Engineering

Experiment 4 Boolean Functions Implementation

Lecture 7. Summary of two-level combinational-logic. Ways of specifying circuits. Solving combinational design problems. Verilog versus VHDL

Administrivia. CSE 370 Spring 2006 Introduction to Digital Design Lecture 9: Multilevel Logic

LECTURE 4. Logic Design

S1 Teknik Telekomunikasi Fakultas Teknik Elektro FEH2H3 2016/2017

Chapter 3 working with combinational logic

Lecture 22: Implementing Combinational Logic

Pearson Education Limited Edinburgh Gate Harlow Essex CM20 2JE England and Associated Companies throughout the world

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

Boolean logic. Boolean Algebra. Introduction to Computer Yung-Yu Chuang NOT AND NOT

Standard Boolean Forms

CS470: Computer Architecture. AMD Quad Core

Functional Block: Decoders

ELCT201: DIGITAL LOGIC DESIGN

QUESTION BANK FOR TEST

Combinational Logic Circuits Part III -Theoretical Foundations

Chapter 3. Gate-Level Minimization. Outlines

Final Examination (Open Katz, asynchronous & test notes only, Calculators OK, 3 hours)

211: Computer Architecture Summer 2016

Combinational Logic Circuits

SEE1223: Digital Electronics

Homework. Update on website issue Reading: Chapter 7 Homework: All exercises at end of Chapter 7 Due 9/26

Gate-Level Minimization. section instructor: Ufuk Çelikcan

Chapter 2 Boolean algebra and Logic Gates

Binary logic. Dr.Abu-Arqoub

EECS 140/141 Introduction to Digital Logic Design Spring Semester 2017 Exam #1 Date: 27 February 2017

Boolean algebra. June 17, Howard Huang 1

LAB #1 BASIC DIGITAL CIRCUIT

Logic design Ibn Al Haitham collage /Computer science Eng. Sameer

A B AB CD Objectives:

7/25/2016. Example: Addition of Unsigned Bit Patterns. ECE 120: Introduction to Computing. Adding Two Non-Negative Patterns Can Overflow

Unit-IV Boolean Algebra

Logic and Computer Design Fundamentals. Chapter 2 Combinational Logic Circuits. Part 3 Additional Gates and Circuits

Philadelphia University Student Name: Student Number:

Announcements. Chapter 2 - Part 1 1

Chapter 2 Combinational

Combinational Digital Design. Laboratory Manual. Experiment #3. Boolean Algebra Continued

Boolean Algebra & Digital Logic

Transcription:

Lecture 7 Logic Simplification

Simplification Using oolean lgebra simplified oolean expression uses the fewest gates possible to implement a given expression. +(+)+(+)

Simplification Using oolean lgebra +(+)+(+) (distributive law) ++++ (rule 7; =) +++++ (rule 5; +=) +++ (rule 10; +=) ++ (rule 10; +=) + +(+)+(+) +

Simplification Using oolean lgebra ssignment [ ( ) ] 8

Standard Forms of oolean Expressions ll oolean expressions, regardless of their form, can be converted into either of two standard forms: The sum-of-products (SOP) form The product-of-sums (POS) form Standardization makes the evaluation, simplification, and implementation of oolean expressions much more systematic and easier.

Sum-of-Products (SOP)

The Sum-of-Products (SOP) Form n SOP expression when two or more product terms are summed by oolean addition. Examples: E lso: In an SOP form, a single overbar cannot extend over more than one variable; however, more than one variable in a term can have an overbar: example: ut not: is OK!

Implementation of an SOP X=++ N/OR implementation NN/NN implementation X X

General Expression SOP ny logic expression can be changed into SOP form by applying oolean algebra techniques. ex: ( ) ( EF) EF ( )( ) ( ) ( ) ( )

The Standard SOP Form standard SOP expression is one in which all the variables in the domain appear in each product term in the expression. Example: Standard SOP expressions are important in: onstructing truth tables The Karnaugh map simplification method

onverting Product Terms to Standard SOP Step 1: Multiply each nonstandard product term by a term made up of the sum of a missing variable and its complement. This results in two product terms. s you know, you can multiply anything by 1 without changing its value. Step 2: Repeat step 1 until all resulting product term contains all variables in the domain in either complemented or uncomplemented form. In converting a product term to standard form, the number of product terms is doubled for each missing variable.

onverting Product Terms to Standard SOP (example) onvert the following oolean expression into standard SOP form: ( ) ( ) ( ) ( ) 8

inary Representation of a Standard Product Term standard product term is equal to 1 for only one combination of variable values. Example: is equal to 1 when =1, =0, =1, and =0 as shown below 1 0 1 0 1111 1 nd this term is 0 for all other combinations of values for the variables.

Product-of-Sums (POS)

The Product-of-Sums (POS) Form When two or more sum terms are multiplied, the result expression is a product-of-sums (POS): Examples: ( )( ( ( )( lso: ) )( E)( )( ) ) ( )( ) In a POS form, a single overbar cannot extend over more than one variable; however, more than one variable in a term can have an overbar: example: ut not: is OK!

Implementation of a POS X=(+)(++)(+) OR/N implementation X

The Standard POS Form standard POS expression is one in which all the variables in the domain appear in each sum term in the expression. Example: ( )( )( ) Standard POS expressions are important in: onstructing truth tables The Karnaugh map simplification method

onverting a Sum Term to Standard POS Step 1: dd to each nonstandard product term a term made up of the product of the missing variable and its complement. This results in two sum terms. s you know, you can add 0 to anything without changing its value. Step 2: pply rule 12 +=(+)(+). Step 3: Repeat step 1 until all resulting sum terms contain all variable in the domain in either complemented or uncomplemented form.

onverting a Sum Term to Standard onverting a Sum Term to Standard POS (example) POS (example) onvert the following oolean expression into onvert the following oolean expression into standard POS form: standard POS form: ) )( )( ( ) )( )( )( )( ( ) )( )( ( ) )( ( ) )( (

inary Representation of a Standard Sum Term standard sum term is equal to 0 for only one combination of variable values. Example: is equal to 0 when =0, =1, =0, and =1 as shown below 0 1 0 1 0 0 0 0 0 nd this term is 1 for all other combinations of values for the variables.

SOP/POS

onverting Standard SOP to The Facts: Standard POS The binary values of the product terms in a given standard SOP expression are not present in the equivalent standard POS expression. The binary values that are not represented in the SOP expression are present in the equivalent POS expression.

onverting Standard SOP to Standard POS What can you use the facts? onvert from standard SOP to standard POS. How? Step 1: Evaluate each product term in the SOP expression. That is, determine the binary numbers that represent the product terms. Step 2: etermine all of the binary numbers not included in the evaluation in Step 1. Step 3: Write the equivalent sum term for each binary number from Step 2 and express in POS form.

onverting Standard SOP to Standard POS (example) onvert the SOP expression to an equivalent POS expression: The evaluation is as follows: 000 010 011101111 There are 8 possible combinations. The SOP expression contains five of these, so the POS must contain the other 3 which are: 001, 100, and 110. ( )( )( )

oolean Expressions & Truth Tables ll standard oolean expression can be easily converted into truth table format using binary values for each term in the expression. lso, standard SOP or POS expression can be determined from the truth table.

onverting SOP Expressions to Recall the fact: Truth Table Format n SOP expression is equal to 1 only if at least one of the product term is equal to 1. onstructing a truth table: Step 1: List all possible combinations of binary values of the variables in the expression. Step 2: onvert the SOP expression to standard form if it is not already. Step 3: Place a 1 in the output column (X) for each binary value that makes the standard SOP expression a 1 and place 0 for all the remaining binary values.

onverting SOP Expressions to Truth Table Format (example) evelop a truth table for the standard SOP expression Inputs Output X 0 0 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 0 1 1 0 0 1 1 1 1 Product Term

onverting POS Expressions to Recall the fact: Truth Table Format POS expression is equal to 0 only if at least one of the product term is equal to 0. onstructing a truth table: Step 1: List all possible combinations of binary values of the variables in the expression. Step 2: onvert the POS expression to standard form if it is not already. Step 3: Place a 0 in the output column (X) for each binary value that makes the standard POS expression a 0 and place 1 for all the remaining binary values.

onverting POS Expressions to Truth Table Format (example) evelop a truth table for the standard SOP expression ( )( )( ) ( )( ) Inputs Output X 0 0 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 0 1 1 0 0 1 1 1 1 Product Term ( ) ( ) ( ) ( ) ( )

etermining Standard Expression from a Truth Table To determine the standard SOP expression represented by a truth table. Instructions: Step 1: List the binary values of the input variables for which the output is 1. Step 2: onvert each binary value to the corresponding product term by replacing: each 1 with the corresponding variable, and each 0 with the corresponding variable complement. Example: 1010

etermining Standard Expression from a Truth Table To determine the standard POS expression represented by a truth table. Instructions: Step 1: List the binary values of the input variables for which the output is 0. Step 2: onvert each binary value to the corresponding product term by replacing: each 1 with the corresponding variable complement, and each 0 with the corresponding variable. Example: 1001

etermining Standard Expression from a Truth Table (example) I/P O/P X 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 1 1 0 0 1 1 0 1 0 1 1 0 1 1 1 1 1 There are four 1s in the output and the SOP corresponding binary value are 011, 100, 110, and 111. There are four 0s in the POS output and the corresponding binary value are 000, 001, 010, and 101. 011 100 000 001 110 010 111 101 X X ( )( )( )( )

Rules of oolean lgebra 1. 0 7. 2. 1 1 8. 0 3. 0 4. 1 0 9. 10. 5. 11. 6. 1 12.( )( ),, and can represent a single variable or a combination of variables. 7

ssignment - 7 What are the similarities and differences in SOP and POS.