User s Manual. Ronwaldo A. Collado Diosdado Y. Tejoso Jr. CMSC 130 Logistic Design and Digital Computer Circuits Second Semester, A. Y.

Similar documents
Karnaugh Map (K-Map) Karnaugh Map. Karnaugh Map Examples. Ch. 2.4 Ch. 2.5 Simplification using K-map

3.4 QUINE MCCLUSKEY METHOD 73. f(a, B, C, D, E)¼AC ĒþB CD þ BCDþĀBD.

Introduction. The Quine-McCluskey Method Handout 5 January 24, CSEE E6861y Prof. Steven Nowick

Quine-McCluskey Algorithm

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

Combinational Logic Circuits

A B AB CD Objectives:

Combinational Logic Circuits Part III -Theoretical Foundations

CSE 140: Logic Minimization Lecture

Chapter 6. Logic Design Optimization Chapter 6

5. Minimizing Circuits

Chapter 3 Simplification of Boolean functions

UNIT II. Circuit minimization

Simplification of Boolean Functions

Gate Level Minimization Map Method

TWO-LEVEL COMBINATIONAL LOGIC

Synthesis 1. 1 Figures in this chapter taken from S. H. Gerez, Algorithms for VLSI Design Automation, Wiley, Typeset by FoilTEX 1

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

Chapter 2. Boolean Expressions:

Module -7. Karnaugh Maps

Combinational hazards

CSE 140 Homework Three

Chapter 2 Combinational Logic Circuits

A graphical method of simplifying logic

Gate-Level Minimization. section instructor: Ufuk Çelikcan

Combinational Logic & Circuits

University of Technology

4 KARNAUGH MAP MINIMIZATION

Gate Level Minimization

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

IT 201 Digital System Design Module II Notes

Chapter 3. Gate-Level Minimization. Outlines

DIGITAL CIRCUIT LOGIC UNIT 5: KARNAUGH MAPS (K-MAPS)

Combinational Logic Circuits

CS470: Computer Architecture. AMD Quad Core

Contents. Chapter 3 Combinational Circuits Page 1 of 34

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

Combinatorial Algorithms. Unate Covering Binate Covering Graph Coloring Maximum Clique

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

CMPE223/CMSE222 Digital Logic

Austin Herring Recitation 002 ECE 200 Project December 4, 2013

Giovanni De Micheli. Integrated Systems Centre EPF Lausanne

Software Implementation of Break-Up Algorithm for Logic Minimization

INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR Stamp / Signature of the Invigilator

ECE 5745 Complex Digital ASIC Design Topic 12: Synthesis Algorithms

Switching Circuits & Logic Design

CSCI 220: Computer Architecture I Instructor: Pranava K. Jha. Simplification of Boolean Functions using a Karnaugh Map

WWW-BASED BOOLEAN FUNCTION MINIMIZATION

DKT 122/3 DIGITAL SYSTEM 1

Digital Logic Lecture 7 Gate Level Minimization

Two-Level Logic Optimization ( Introduction to Computer-Aided Design) School of EECS Seoul National University

ICS 252 Introduction to Computer Design

Department of Electrical and Computer Engineering University of Wisconsin - Madison. ECE/CS 352 Digital System Fundamentals.

ECE380 Digital Logic

Switching Theory And Logic Design UNIT-II GATE LEVEL MINIMIZATION

Experiment 3: Logic Simplification

Combinational Circuits Digital Logic (Materials taken primarily from:

CS8803: Advanced Digital Design for Embedded Hardware

VALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC6302 DIGITAL ELECTRONICS

VLSI System Design Part II : Logic Synthesis (1) Oct Feb.2007

ELCT201: DIGITAL LOGIC DESIGN

Specifying logic functions

Digital Logic Design. Outline

Two-Level Multiple-Output Combinational Networks Design Web-based Tutoring Tool

EECS 140/141 Introduction to Digital Logic Design Fall Semester 2016 Exam #1 Date: 3 October 2016

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

ELCT201: DIGITAL LOGIC DESIGN

Outcomes. Unit 9. Logic Function Synthesis KARNAUGH MAPS. Implementing Combinational Functions with Karnaugh Maps

Gate-Level Minimization

2.6 BOOLEAN FUNCTIONS

Gate-Level Minimization

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

Simplification of Boolean Functions

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

ENGIN 112 Intro to Electrical and Computer Engineering

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

Experiment 4 Boolean Functions Implementation

Chapter 2 Combinational

Breakup Algorithm for Switching Circuit Simplifications

1. Mark the correct statement(s)

EECS150 Homework 2 Solutions Fall ) CLD2 problem 2.2. Page 1 of 15

10EC33: DIGITAL ELECTRONICS QUESTION BANK

CprE 281: Digital Logic

數位系統 Digital Systems 朝陽科技大學資工系. Speaker: Fuw-Yi Yang 楊伏夷. 伏夷非征番, 道德經察政章 (Chapter 58) 伏者潛藏也道紀章 (Chapter 14) 道無形象, 視之不可見者曰夷

Gate-Level Minimization

DIGITAL CIRCUIT LOGIC UNIT 7: MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES


SEE1223: Digital Electronics


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

DIGITAL TECHNICS. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute 2. LECTURE: LOGIC NETWORK MINIMIZATION 2016/2017

CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN Lecture Notes

Larger K-maps. So far we have only discussed 2 and 3-variable K-maps. We can now create a 4-variable map in the

Code No: R Set No. 1

NH 67, Karur Trichy Highways, Puliyur C.F, Karur District DEPARTMENT OF INFORMATION TECHNOLOGY CS 2202 DIGITAL PRINCIPLES AND SYSTEM DESIGN

Review: Standard forms of expressions

Boolean Function Simplification

Chapter 2 Combinational Logic Circuits

Introduction. Inserting and Modifying Tables. Word 2010 Working with Tables. To Insert a Blank Table: Page 1

Slide Set 5. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary

Transcription:

The Quine-McCluskey Method, also known as the Tabulation Method is a specific step-by-step method that is ensured to generate a simplified standard-form expression for a function. Ronwaldo A. Collado Diosdado Y. Tejoso Jr. CMSC 130 Logistic Design and Digital Computer Circuits Second Semester, A. Y. 2012-3013

ii Quine-McCluskey Simulator

iii Table of Contents About the Quine-McCluskey Method...iv About the Quine-McCluskey Simulator...v Your First Glance to the Simulator...1 The Simulator Window...2 The Variable Menu...3 The Input/Output Menu...4 The Input Area...5 The Quine-McCluskey Simulation...7 Renaming Your Function...8 Adding another Function...9

iv Quine-McCluskey Simulator About the Quine-McCluskey Method Karnaugh maps are very effective for the minimization of expressions with up to 5 or 6 inputs. However, Karnaugh maps are difficult to use with a large number of inputs, since it is hard to find groups of adjacent squares. Also, according to Amaral (2003), Karnaugh maps depend on our ability to visually identify prime implicants and select a set of prime implicants that cover all minterms. They do not provide a direct algorithm to be implemented in a computer. The Quine-McCluskey method is an exact algorithm which finds a minimum-cost sum-of-products implementation of a Boolean function. It has four main steps (Nowick, 2013): 1. Generate Prime Implicants 2. Construct Prime Implicant Table 3. Reduce Prime Implicant Table a. Remove Essential Prime Implicants b. Row Dominance c. Column Dominance 4. Solve Prime Implicant Table

v About the Quine-McCluskey Simulator The Quine-McCluskey Simulator is an Executable Jar File that performs the Quine-McCluskey Method. It only needs the designation numbers of the minterms where a Boolean function evaluates to 1. Also, this simulator enables the user to manipulate: 1. the variable usage; and 2. the input and output types. Moreover, the simulator shows the complete process of the Quine-McCluskey Method. It enables the user to add another Boolean function to work on.

vi Quine-McCluskey Simulator

1 Your First Glance to the Simulator Y ou must open the Executable Jar File in order to use the Quine- McCluskey Simulator. This will be your first glance to the simulator: After entering your name (e. g. User 1):

2 Quine-McCluskey Simulator The Simulator Window Title Bar: Notice that the name entered is viewed Variable Menu: The user can manipulate the variable usage. (More details later) Input Area Output Area Input/Output Menu: The user can manipulate the input and output type. (More details later)

3 The Variable Menu 1 2 3 4 1 Variable Count: It indicates the number of variables to be used. If checked, the number of variables to be used should be placed in the textarea (maximum number of terms is 20). If remained unchecked, the number of variables to be used will depend on the largest designation number in the input area (where the minterms or maxterms should be listed). 2 Default: The default variables are the letters of the alphabet starting from a. It is arranged sequentially (i. e. a, b, c, and so on.). 3 Random: The variables to be used will be selected randomly from the letters of the English alphabet. (i. e. It will not be arranged alphabetically) 4 4 Sequential: It is used when Random option was selected. It indicates that the variables to be used should be arranged alphabetically.

The Input/Output Menu 1 2 1 Input Type Options: The default input type is in minterms (designation number of the terms where the function evaluates to 1). If the user chooses that the input type to be in maxterms, he/she should input the designation number of the terms where the function evaluates to 0. 2 Output Type Options: If the input type is in minterms the default output type is in sum of products form (i. e., ab + cd + e). When the input type is in maxterms, the default output type is in product of sums form (i. e., (a + b)(c + d)(e)). The user can change the output type by first marking the checkbox, then selecting the output type he/she desires.

5 The Input Area 1 2 1 Input Text Area: The input should be written in this text box. The label already explains the format to be used. Note that each designation number of the terms must be separated by spaces. 2 No Input Terms: This checkbox is used to declare that there are no input minterms nor maxterms in the function. 2 OK Button: When clicked, the Quine-McCluskey Simulation will begin. (You may not click this button by pressing Enter ). 3

6 Quine-McCluskey Simulator The Quine-McCluskey Simulation Now that you are familiar to the environment of the Quine- McCluskey Simulator, let us try an example: Obtain the simplified expression of a Boolean function containing the minterms evaluating to 1 at: 6, 9, 13, 18, 19, 25, 27, 29, 41, 45, 57, and 61. Step 1: Type in the designated number of minterms evaluating to 1 in the input text area.

7 Step 2: Click OK or press Enter. Solution Summary: Displays the given function and the simplified expression/s obtained using the Quine- McCluskey Method Closes the current Tab You can rename the tab label of the function Solution Box: Displays the complete solution using the Quine- McCluskey Method* Navigation Buttons You can navigate between tables or charts using these buttons * In this example, you can see, four grouping tables, the prime implicants table, the prime implicants chart, removal of essential implicants, Petrick s method, and the possible combinations (there are two possible simplified expressions in this example).

8 Quine-McCluskey Simulator Renaming Your Function As viewed in the previous page, you can rename the tab label of your current function. After clicking the Rename Function button: In this case, we can used Example 1 :

9 Adding another Function As stated at the About the Quine-McCluskey Simulator, you can work on another Boolean function. In the Menu (located below the title bar), there is an option on adding another Boolean function. After selecting Add a Boolean Function, the simulator window will look like: Notice that the previous function is already viewed at the output area. Now, you can work on another function and view your previous ones!