Activity Truth Tables & Logic Expressions

Similar documents
This form sometimes used in logic circuit, example:

Combinational Logic Circuits Part II -Theoretical Foundations

Boolean Algebra and Logic Simplification

Introduction to Karnaugh Maps

Chapter 2 Combinational Logic Circuits

The Karnaugh Map COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals

UNIT 4 MINTERM AND MAXTERM EXPANSIONS

New Students Day Activity

Computer Organization I

Learning Objectives 10/7/2010. CE 411 Digital System Design. Fundamental of Logic Design. Review the basic concepts of logic circuits. Dr.

Contents. Chapter 3 Combinational Circuits Page 1 of 36

14:332:231 DIGITAL LOGIC DESIGN. Combinational Circuit Synthesis

Chapter 2 Combinational Logic Circuits

XOR - XNOR Gates. The graphic symbol and truth table of XOR gate is shown in the figure.

Ex: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.

ELCT201: DIGITAL LOGIC DESIGN

Chapter 7 Logic Circuits

Boolean Algebra & Logic Gates. By : Ali Mustafa

EC-121 Digital Logic Design

211: Computer Architecture Summer 2016

CS 226: Digital Logic Design

CprE 281: Digital Logic

XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.

Simplifying Logic Circuits with Karnaugh Maps

CHAPTER 7. Solutions for Exercises

Chapter 1: Logic systems

Z = F(X) Combinational circuit. A combinational circuit can be specified either by a truth table. Truth Table

Combinational Digital Design. Laboratory Manual. Experiment #6. Simplification using Karnaugh Map

II. COMBINATIONAL LOGIC DESIGN. - algebra defined on a set of 2 elements, {0, 1}, with binary operators multiply (AND), add (OR), and invert (NOT):

Why digital? Overview. Number Systems. Binary to Decimal conversion

Lecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University

Chapter 2: Boolean Algebra and Logic Gates

Review Getting the truth table

University of Toronto Faculty of Applied Science and Engineering Department of Electrical and Computer Engineering Midterm Examination

7.1. Unit 7. Minterm and Canonical Sums 2- and 3-Variable Boolean Algebra Theorems DeMorgan's Theorem Simplification using Boolean Algebra

Overview. Multiplexor. cs281: Introduction to Computer Systems Lab02 Basic Combinational Circuits: The Mux and the Adder

Digital Logic Design. Midterm #2

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering

Combinatorial Logic Design Principles

Minimization techniques

Lecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps

Karnaugh Map & Boolean Expression Simplification

WEEK 3.1 MORE ON KARNAUGH MAPS

MC9211 Computer Organization

Building a Computer Adder

2009 Spring CS211 Digital Systems & Lab CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS

Theorem/Law/Axioms Over (.) Over (+)

Laboratory II. Exploring Digital Logic

Introduction to Digital Logic

Math161 HW#2, DUE DATE:

Chapter 2 Boolean Algebra and Logic Gates

Chapter 2. Boolean Algebra and Logic Gates

Logic and Computer Design Fundamentals. Chapter 2 Combinational Logic Circuits. Part 2 Circuit Optimization

Lecture 2. Notes. Notes. Notes. Boolean algebra and optimizing logic functions. BTF Electronics Fundamentals August 2014

DIGITAL ELECTRONICS & it0203 Semester 3

Lecture 4: More Boolean Algebra

Digital electronics form a class of circuitry where the ability of the electronics to process data is the primary focus.

BOOLEAN ALGEBRA CLASS XII. Presented By : Dinesh Patel PGT CS KV IIT Powai

Digital Logic (2) Boolean Algebra

Number System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary

Part 5: Digital Circuits

Principles of Computer Architecture. Appendix B: Reduction of Digital Logic. Chapter Contents

Digital Logic. CS211 Computer Architecture. l Topics. l Transistors (Design & Types) l Logic Gates. l Combinational Circuits.

CHAPTER III BOOLEAN ALGEBRA

Mark Redekopp, All rights reserved. Lecture 4 Slides. Boolean Algebra Logic Functions Canonical Sums/Products

Combinational Logic Fundamentals

Logic Design. Chapter 2: Introduction to Logic Circuits

Philadelphia University Student Name: Student Number:

Spiral 1 / Unit 3

1 Boolean Algebra Simplification

DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA (CONT.)

Contents. Chapter 2 Digital Circuits Page 1 of 30

Boolean Algebra, Gates and Circuits

control in out in out Figure 1. Binary switch: (a) opened or off; (b) closed or on.

WEEK 2.1 BOOLEAN ALGEBRA

University of California, San Diego Department of Computer Science and Engineering CSE 20. Solutions to Midterm Exam Winter 2018

CPE100: Digital Logic Design I

Chapter 2 : Boolean Algebra and Logic Gates

Digital Circuit And Logic Design I. Lecture 3

BOOLEAN ALGEBRA THEOREMS

CHAPTER III BOOLEAN ALGEBRA

Boolean Algebra and Logic Gates

LOGIC GATES. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.

Systems I: Computer Organization and Architecture

Fundamentals of Computer Systems

Digital Logic Design. Combinational Logic

Mark Redekopp, All rights reserved. Lecture 5 Slides. Canonical Sums and Products (Minterms and Maxterms) 2-3 Variable Theorems DeMorgan s Theorem

Chapter 5. Karnaugh Map and Minimization Procedures

In Module 3, we have learned about Exclusive OR (XOR) gate. Boolean Expression AB + A B = Y also A B = Y. Logic Gate. Truth table

Simplification of Boolean Functions. Dept. of CSE, IEM, Kolkata

ELEC Digital Logic Circuits Fall 2014 Switching Algebra (Chapter 2)

ENGIN 112 Intro to Electrical and Computer Engineering

Digital Circuit And Logic Design I. Lecture 4

6 Simplification of. Boolean Functions

Logic Simplification. Boolean Simplification Example. Applying Boolean Identities F = A B C + A B C + A BC + ABC. Karnaugh Maps 2/10/2009 COMP370 1

Section 2.7 Solving Linear Inequalities

EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive

EXPERIMENT #4: SIMPLIFICATION OF BOOLEAN FUNCTIONS

Fundamentals of Computer Systems

Chapter 2 Boolean Algebra and Logic Gates

Transcription:

Activity 2.1.3 Truth Tables & Logic Expressions Introduction The first step in designing a new product is creating a design specifications document. These design specifications detail all of the features and limitations of the new product. In digital electronics, the process of translating these design specifications into a functioning circuit starts with the creation of a truth table. A truth table is simply a list of all possible binary input combinations that could be applied to a circuit and the corresponding binary outputs that the circuit produces. Once the truth table is complete, a Boolean expression can easily be written directly from the truth table. In this activity you will learn how to translate design specifications into truth tables and, in turn, write un-simplified logic expressions from these truth tables. In future activities we will learn how to use Boolean algebra as well as a graphical technique called Karnaugh mapping to simplify these logic expressions. Equipment Paper & Pencil Calculator Procedure Before we tackle the more challenging aspects of translating a written specification into a truth-table, let s take a look at the process of writing an un-simplified logic expression from a completed truth table. Example: A B Z Minterms 0 0 0 A B A B 1 1 0 Z = A B + A B DE Activity 2.1.3 Truth Tables & Logic Expressions Page 1

Using the above example (previous page) as a guide, write the un-simplified logic expression for each of the following truth tables. Though it is not required, you may find it helpful to first write the Minterm expression for every place containing a one in the output function. 1. 2. 5. M N F 1 0 1 0 1 0 0 X Y F 2 0 1 0 W X Y Z F 5 0 0 0 0 0 0 0 0 1 1 0 F 1 = F 2 = 0 1 0 1 3. 4. 0 0 0 0 1 0 0 0 0 1 0 P Q R F 3 0 0 0 0 1 0 1 0 0 0 1 0 1 0 J K L F 4 0 0 0 0 1 0 1 0 0 0 1 0 1 1 0 0 1 0 1 1 0 1 1 1 0 0 1 1 0 F 3 = F 4 = F 5 = DE Activity 2.1.3 Truth Tables & Logic Expressions Page 2

Now that you have mastered the process of writing an un-simplified logic expression from a completed truth table, let s reverse the process. For the following logic expressions, create a corresponding truth table. Note that some terms in the logic expression may map to more than one place in the truth table. 1. F 1 = C D + C D 2. F 2 = R S T + R S + R S T + S T 3. F 3 = A B C + A B C + A B C + A C DE Activity 2.1.3 Truth Tables & Logic Expressions Page 3

Now that you understand the mechanics of converting from a truth table to a logic expression (and vice-versa). Let s look at a problem that begins with some written specifications. Your new car has an audio alarm that buzzes whenever the door is open and the key is in the ignition or when the key is in the ignition and the seatbelt is not buckled. 1. Using the following variable names and assignment conditions 2. Complete the truth table shown below that captures the functionality of this audio alarm. D: Door 0=Door Open / 1=Door Close K: Key 0=Key Not in Ignition / 1=Key in Ignition S: Seat 0=Not Buckled / 1=Buckled B: Buzzer 0=Buzzer Off / 1=Buzzer On D K S B (Door) (Key) (Seat Belt) (Buzzer) 0 0 0 0 1 0 1 0 0 1 1 0 3. Using the truth table you just created, write the un-simplified logic expression for the buzzer (i.e., variable B). Be sure that your answer is in the Sum-of- Products form. In a future activity, you will see that this logic expression can be simplified to: B = D K + K S DE Activity 2.1.3 Truth Tables & Logic Expressions Page 4

Note: Some of you may have been able to extract this simplified logic expression directly from the specifications. If so, you may be asking yourself, why did I have to go through the process of creating the truth table and writing the un-simplified logic expression first? This was a simple problem. As you progress through this class, the design problems will become more difficult The process that you are learning now will become invaluable in solving more challenging problems. Your Aunt Mary would like you to design a digital logic circuit that monitors the conditions in a room of her house where her seven cats live. The room s temperature is monitored by a temperature sensor. The room s humidity is monitored by a humidity sensor. The air quality of the room is monitored by a special sensor that measures fur-ball density. The three sensors output a one (1) to indicate an out-of-range condition. Located outside of the room is an ALERT light that is on (1) whenever two or more sensors are out-ofrange. 1. Create a truth table that captures the functionality of this room monitoring system. 2. Using the truth table that you just created, write the un-simplified logic expression for the ALERT light. Be sure that your answer is in the Sum-of-Products form. DE Activity 2.1.3 Truth Tables & Logic Expressions Page 5

Conclusion 1. A digital logic circuit with (2) inputs has (4) input combinations. One with (3) inputs has (8) combinations. One with (4) inputs has (16) combinations. 2. How many input combinations would a digital logic circuit have if it has (5) inputs? How about (6) input? 3. Mathematically express the relationship between the number of input (N) and the number of input combinations (C). 4. Write the un-simplified logic expression for the truth table shown below. X Y Z Did you see the short cut? (Hint: Z is always a one.) Going Further Optional The un-simplified logic expression for the truth table shown below is; A B C 1 0 0 C = A B + A B + A B Another way to write this would be Explain why this is true. C = A B. DE Activity 2.1.3 Truth Tables & Logic Expressions Page 6