Mariza Wijayanti 11407050. Introduction Design of kmap minimizer Result and Discussion.

Slides:

Advertisements

Similar presentations

Chapter 3 Gate-Level Minimization

Advertisements

ECE 3110: Introduction to Digital Systems

Boolean Algebra and Combinational Logic

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-10, 7-4 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.

Combinational Logic Discussion D2.5. Combinational Logic Combinational Logic inputsoutputs Outputs depend only on the current inputs.

Sequential Logic Design

ENGIN112 L13: Combinational Design Procedure October 1, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 13 Combinational Design Procedure.

CS 151 Digital Systems Design Lecture 13 Combinational Design Procedure.

Week 3- slide 1 EE 231 Digital Electronics Fall 01 Gate Logic: Two-Level Simplification K-Map Method Examples F = A asserted, unchanged B varies G = B’,

Combinational Logic Design

Boolean Algebra and Logic Simplification

Figure 5–1 An example of AND-OR logic. Open file F05-01 to verify the operation. Thomas L. Floyd Digital Fundamentals, 9e Copyright ©2006 by Pearson Education,

Lecture 3: Incompletely Specified Functions and K Maps CSE 140: Components and Design Techniques for Digital Systems Fall 2014 CK Cheng Dept. of Computer.

Digital Computer Design Fundamental

Digital Logic Circuits – Chapter 1 Section 1-3, 1-2.

KU College of Engineering Elec 204: Digital Systems Design

Circuit, State Diagram, State Table

Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Lecture 12 – Design Procedure.

Logic Function Optimization. Combinational Logic Circuit Regular SOP and POS designs Do not care expressions Digital logic circuit applications Karnaugh.

1 Fundamentals of Computer Science Propositional Logic (Boolean Algebra)

DeMorgan Theorem, Computer Simulation Exercises

COE4OI5 Engineering Design. Copyright S. Shirani 2 Course Outline Design process, design of digital hardware Programmable logic technology Altera’s UP2.

Logic Design Computer Architecture and Design Lecture 1.

9/15/09 - L7 Two Level Circuit Optimization Copyright Joanne DeGroat, ECE, OSU1 Two Level Circuit Optimiztion An easier way to generate a minimal.

Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.

Digital Circuits Design Chin-Sung Lin Eleanor Roosevelt High School.

Digital Electronics Lecture 6 Combinational Logic Circuit Design.

1 Combinational Logic Design Digital Computer Logic Kashif Bashir

Unit 8 Combinational Circuit Design and Simulation Using Gates Fundamentals of Logic Design by Roth and Kinney.

Chapter 5 Boolean Algebra and Reduction Techniques 1.

Figure 4–1 Application of commutative law of addition. Thomas L. Floyd Digital Fundamentals, 9e Copyright ©2006 by Pearson Education, Inc. Upper Saddle.

Digital Circuits State Reduction and Assignment State Reduction reductions on the number of flip-flops and the number of gates a reduction in the.

DESIGN OF SEQUENTIAL CIRCUITS by Dr. Amin Danial Asham.

Karnaugh Mapping Digital Electronics. Karnaugh Mapping or K-Mapping This presentation will demonstrate how to Create and label two, three, & four variable.

ECE 3110: Introduction to Digital Systems Chapter #4 Review.

CS151 Introduction to Digital Design Chapter Map Simplification.

Karnaugh Maps (K maps). What are Karnaugh 1 maps?  Karnaugh maps provide an alternative way of simplifying logic circuits.  Instead of using Boolean.

Boolean Expressions Lecture 3 Digital Design and Computer Architecture Harris & Harris Morgan Kaufmann / Elsevier, 2007.

Karnaugh Maps (K-Maps)

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Binary Numbers For digital systems, the.

Sequential Circuit Design By : Pn Siti Nor Diana Ismail CHAPTER 6.

Chapter 4 OPTIMIZED IMPLEMENTATION OF LOGIC FUNCTIONS.

Chapter 0 – Week 2 Combinational Logic Design. What have been discussed Design hierarchy –Top – down –Bottom – up CAD HDL Logic synthesis.

School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan.

CHAPTER 14 Digital Systems. Figure 14.1 RS flip-flop symbol and truth table Figure

Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 

Lecture 1 Gunjeet kaur Dronacharya group of institutions.

Digital Systems Design 1 Signal Expressions Multiply out: F = ((X + Y)  Z) + (X  Y  Z) = (X  Z) + (Y  Z) + (X  Y  Z)

CS151 Introduction to Digital Design Chapter 3: Combinational Logic Design 3-4 Verification 1Created by: Ms.Amany AlSaleh.

EET 1131 Unit 4 Programmable Logic Devices

MTE3 on , Tuesday 9:00-10:15, 10:30-11:45 AM 414W - PAB

ECE 2110: Introduction to Digital Systems

Dr. Clincy Professor of CS

FINITE STATE MACHINES (FSMs)

CSE 140 : Components and Design Techniques for Digital Systems

Digital Design Fundamentals

Karnaugh Maps (K-Maps)

Dr. Clincy Professor of CS

BASIC & COMBINATIONAL LOGIC CIRCUIT

ECE 3130 – Digital Electronics and Design

Homework Reading Tokheim, Section 5-10, 7-4.

13 Digital Logic Circuits.

ECB2212-Digital Electronics K-Map

DESIGN OF SEQUENTIAL CIRCUITS

CS Chapter 3 (3A and ) – Part 3 of 5

Dr. Clincy Professor of CS

Karnaugh Map Method By: Asst Lec. Besma Nazar Nadhem

Simplification of Boolean Functions using K-Maps

Presentation transcript:

Mariza Wijayanti

Introduction Design of kmap minimizer Result and Discussion

Background. The function of the hardware and software computer device are currently expanding. The facilities provided in a computer device are designed to assist people in complete the work that cannot be done by human hands, or just facilitate. The karnaugh map is a table that serves to simplify the digital circuits. Based on the core of the problem above the authors design program kmap to simplify the digital circuit with short time Problem Statement. How to make the program karnaugh map with few variables to simplify the digital circuits in a short time. Scope of The Research. System program karnaugh map with 2, 3, and 4 variables using the language Programming Logic. Objective of The Research. Know more in about the use of software Swi-Prolog The produced program can be used as a means to support jobs for people working in the fields of digital circuit either directly or indirectly.

Design the counter that repeat sequences: 0, 4, 12, 13, 6, 7, 2, 5,10, 0, 4, 12, 13, 6... By using the D-FIP-flop. The first step in created state diagram: Figure State diagram

Step 2: Specify the truth table above is based on state diagram Table Truth table state diagram

Step 3: Mapping the truth table into Kmap Figure The obtained of value of Da using kmap

Figure The obtained of value of Db using kmap

Figure The obtained of value of Dc using kmap

Figure The obtained of value of Dd using kmap

Step 4: Determine the equation of a digital circuit

Step 5: Drawn a digital circuit equations in the schematic editor Figure Schematic counter

Step 7: Analysis of results of series From the figure above can be viewed that the counter which has been designed with care because the output of sequence: 0, 4, 12, 13, 6, 7, 2, 5, 10, 0, 4, 12, 13, 6... Figure The simulation counter

Some processes kmap with 2, 3, and 4 variables can be done by automated logic minimizer by using logic programming. Results from experiments digital circuit before simplified and after simplified by automated logic programming has the same result. Cost the component of the digital circuits by using kmap can be minimized without affecting the output desired Time used to simplify the digital circuits much less. Prolog language as one of the programming language is quite effective to use in the process of logic programming

Simplification kmap digital circuits up to the n variables. Displaying interface to users can be made better. Directly displaying the simplified digital circuit.

THANK YOU FOR YOUR ATTENTION