Logic Gates, Boolean Algebra and Karnaugh Maps

Slides:



Advertisements
Similar presentations
Programming Logic Gate Functions in PLCs
Advertisements

Digital Circuits.
ECE 238L Computer Logic Design Spring 2010
ECE 2373 Modern Digital System Design Exam 2. ECE 2372 Exam 2 Thursday March 5 You may use two 8 ½” x 11” pages of information, front and back, write.
1 Homework Reading –Tokheim, Section 5-1, 5-2, 5-3, 5-7, 5-8 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.
Lecture 14 Today we will Learn how to implement mathematical logical functions using logic gate circuitry, using Sum-of-products formulation NAND-NAND.
Erik Jonsson School of Engineering and Computer Science FEARLESS Engineeringwww.utdallas.edu/~pervin EE/CE 2310 – HON/002 Introduction to Digital Systems.
ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives
In this module you will learn: What the various logic gates do. How to represent logic gates on a circuit diagram. The truth tables for the logic gates.
Boolean Algebra and Logic Simplification
LOGIC GATES Logic generally has only 2 states, ON or OFF, represented by 1 or 0. Logic gates react to inputs in certain ways. Symbol for AND gate INPUT.
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
Sahar Mosleh PageCalifornia State University San Marcos 1 Multiplexer, Decoder and Circuit Designing.
Chapter 3.5 Logic Circuits. How does Boolean algebra relate to computer circuits? Data is stored and manipulated in a computer as a binary number. Individual.
DeMorgan Theorem, Computer Simulation Exercises
1 The Chinese University of Hong Kong Faculty of Education Diploma in Education (Part-Time) Winter 1997 Educational Communications and Technology Assignment.
Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.
Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.
ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.
CH51 Chapter 5 Combinational Logic By Taweesak Reungpeerakul.
+ CS 325: CS Hardware and Software Organization and Architecture Gates and Boolean Algebra Part 3.
Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 5 © 2008 Pearson Education.
1 Digital Logic Design Week 5&6 cont’d Revision for Quiz 2/Exam.
Chapter 2 Boolean Algebra and Minimization Techniques.
Karnaugh Maps (K maps). What are Karnaugh 1 maps?  Karnaugh maps provide an alternative way of simplifying logic circuits.  Instead of using Boolean.
1 Homework Reading –Tokheim, Section 5-1, 5-2, 5-3, 5-7, 5-8 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.
Karnaugh Maps (K-Maps)
Circuits & Boolean Expressions. A ABC BC ABC C B A Example # 1: Boolean Expression: Develop a Boolean expression from a circuit.
Unit II Fundamentals of Logic Design By Roth and Kinney.
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.
Logic Gates and Boolean Algebra Introduction to Logic II.
Logic Gates, Boolean Algebra and Karnaugh Maps. Challenge! By the end of todays session can you complete the following?
Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 
Programmable Logic Controller
Lecture 1 Gunjeet kaur Dronacharya group of institutions.
Combinational Circuits Part 1
Homework Reading Machine Projects Labs
Eng. Mai Z. Alyazji October, 2016
Questions Describe the following gates
MTE3 on , Tuesday 9:00-10:15, 10:30-11:45 AM 414W - PAB
Logic Gates.
Combinational Circuit Design
Boolean Expressions Lecture No. 10.
Computer Architecture CST 250
Circuits & Boolean Expressions
XOR, XNOR, and Binary Adders
Karnaugh Maps (K-Maps)
Recapping: Writing with algebra
BASIC & COMBINATIONAL LOGIC CIRCUIT
Combinational Logic Design Process
XOR, XNOR, & Binary Adders
Example Question: Consider the expressions: (a) F = XY + XY'
Logic Gates.
A-level Computer Science
ECB2212-Digital Electronics K-Map
GCSE Computer Science – Logic Gates & Boolean Expressions
Binary Logic.
Karnaugh Maps (K maps).
XOR, XNOR, and Binary Adders
Combinational Logic Circuit
Principles & Applications
Karnaugh Map Method By: Asst Lec. Besma Nazar Nadhem
Introduction to Logic diagrams and truth tables
Introduction to Logic diagrams and truth tables
Circuits & Boolean Expressions
Circuit Simplification and
Computer Architecture
Presentation transcript:

Logic Gates, Boolean Algebra and Karnaugh Maps

Boolean algebra A B C D 1 Using logic gate diagrams and truth tables Complete the truth table for the following logic diagram: A B C D 1 A C D B

Boolean algebra A B C D 1 Using logic gate diagrams and truth tables Complete the truth table for the following logic diagram: A B C D 1 C A D B

Boolean algebra A B C D E 1 Using logic gate diagrams and truth tables Complete the truth table for the following logic diagram: A B C D E 1 A D B E C

Boolean algebra A B C D E F 1 Using logic gate diagrams and truth tables Complete the truth table for the following logic diagram: A B C D E F 1 A B D F E C

Boolean algebra A B C D E F 1 Using logic gate diagrams and truth tables Complete the truth table for the following logic diagram: A B C D E F 1 A D F E B C

Boolean algebra A B C D E F 1 Using logic gate diagrams and truth tables Complete the truth table for the following logic diagram: A B C D E F 1 A B D F E C

¬ ⊻ NOT AND ⊕ OR XOR ∨ ∧ Boolean algebra Define problems using Boolean logic Match the symbol to the operator. ⊻ NOT ¬ AND ⊕ OR XOR ∨ ∧

Use the correct symbols to define the following Boolean expressions: Boolean algebra Use the correct symbols to define the following Boolean expressions: Define problems using Boolean logic 1 A  ^ 2 ¬   D  V  C 3 B 4   V   C 5  ¬ 6 7  D 8 9 B  ^  10 C V  D   A 11 12  B

Boolean algebra Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions 1. What expression does this Karnaugh map illustrate? > A A B 1

Boolean algebra Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions 2. What expression does this Karnaugh map illustrate? > NOT B A B 1

Boolean algebra Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions 3. What expression does this Karnaugh map illustrate? > NOT A OR NOT B A B 1

Boolean algebra Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions 4. What expression does this Karnaugh map illustrate? > A AND B A B 1

Boolean algebra Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions 5. What expression does this Karnaugh map illustrate? > NOT A AND B A B 1

Boolean algebra Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions 1. Write the expression: A ∧ B ∨ C into the Karnaugh map, and draw rectangles/squares around the groups. AB C 00 01 11 10 1

Boolean algebra Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions 2. Write the expression: ¬A ∧ B ∨ ¬C into the Karnaugh map, and draw rectangles/squares around the groups. AB C 00 01 11 10 1

Boolean algebra Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions 3. Write the expression: ¬A ∧ ¬B ∨ C into the Karnaugh map, and draw rectangles/squares around the groups. AB C 00 01 11 10 1

Boolean algebra Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions 4. Write the expression: ¬A ∧ ¬B ∨ ¬A ∧ B ∨ C into the Karnaugh map, and draw rectangles/squares around the groups. What is the simplified version of this expression? AB C 00 01 11 10 1

Boolean algebra Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions 5. Write the expression: A ∧ ¬B ∨ ¬A ∧ ¬B ∨ ¬C into the Karnaugh map, and draw rectangles/squares around the groups. What is the simplified version of this expression? AB C 00 01 11 10 1

Boolean algebra Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions 6. Write the expression: A ∧ B ∧ C ∨ ¬A ∧ ¬B ∨ C into the Karnaugh map, and draw rectangles/squares around the groups. What is the simplified version of this expression? AB C 00 01 11 10 1

Boolean algebra Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions 1. Write the expression: A ∧ D ∨ B ∧ D ∨ A ∧ ¬B ∧ C ∧ D into the Karnaugh map, and draw rectangles/squares around the groups and show the simplified expression. > A ∧ D ∨ B ∧ D CD AB 00 01 11 10 1

Boolean algebra Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions 2. Write the expression: ¬A ∧ B ∨ ¬A ∧ ¬B ∧ D ∨ ¬A ∧ D into the Karnaugh map, and draw rectangles/squares around the groups and show the simplified expression. > ¬A ∧ B ∨ ¬A ∧ D CD AB 00 01 11 10 1

Boolean algebra Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions 3. Write the expression: A ∧ ¬B ∨ ¬C ∧ ¬D ∨ A ∧ B into the Karnaugh map, and draw rectangles/squares around the groups and show the simplified expression. > :A ∨ ¬C ∧ ¬D CD AB 00 01 11 10 1

Boolean algebra Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions 4. Write the expression: ¬B ∧ ¬D ∨ A ∧ ¬B ∧ C ∧ ¬D into the Karnaugh map, and draw rectangles/squares around the groups and show the simplified expression. > ¬B ∧ ¬D CD AB 00 01 11 10 1

Boolean algebra Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions 5. What is the expression shown in the Karnaugh map? > A ∧ B ∨ ¬C CD AB 00 01 11 10 1

Boolean algebra Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions 6. What is the expression shown in the Karnaugh map? > ¬A ∧ B ∧ C ∧ D ∨ A ∧ B ∧ ¬C ∧ D CD AB 00 01 11 10 1

Challenge! Simplify the following: A∧B∧C∨A∧¬B∧C∨A∧B∧¬C AB C 00 01 11 10 1