SEE1223: Digital Electronics

Similar documents
Combinational Logic Circuits

DKT 122/3 DIGITAL SYSTEM 1

4 KARNAUGH MAP MINIMIZATION

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

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

Combinational Logic Circuits Part III -Theoretical Foundations

ENGIN 112 Intro to Electrical and Computer Engineering

A B AB CD Objectives:

Specifying logic functions

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

Chapter 2 Combinational Logic Circuits

Digital Logic Lecture 7 Gate Level Minimization

Switching Circuits & Logic Design

CMPE223/CMSE222 Digital Logic

A graphical method of simplifying logic

Module -7. Karnaugh Maps

ECE380 Digital Logic

Chapter 2 Combinational Logic Circuits

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

Chapter 3. Gate-Level Minimization. Outlines

University of Technology

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

Ch. 5 : Boolean Algebra &

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

Chapter 2 Combinational

IT 201 Digital System Design Module II Notes

Summary. Boolean Addition

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

Chapter 3 Simplification of Boolean functions

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

Experiment 4 Boolean Functions Implementation

Experiment 3: Logic Simplification

Quine-McCluskey Algorithm

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

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

Simplification of Boolean Functions

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

Chapter 2. Boolean Expressions:

ELCT201: DIGITAL LOGIC DESIGN

EEE130 Digital Electronics I Lecture #4_1

ELCT201: DIGITAL LOGIC DESIGN

Combinational Circuits Digital Logic (Materials taken primarily from:

Gate Level Minimization Map Method

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

Unit-IV Boolean Algebra

Gate-Level Minimization

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

CprE 281: Digital Logic

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

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

QUESTION BANK FOR TEST

Literal Cost F = BD + A B C + A C D F = BD + A B C + A BD + AB C F = (A + B)(A + D)(B + C + D )( B + C + D) L = 10

Review: Standard forms of expressions

Combinational Logic & Circuits

UNIT II. Circuit minimization

Simplification of Boolean Functions


Boolean Function Simplification

BOOLEAN ALGEBRA. Logic circuit: 1. From logic circuit to Boolean expression. Derive the Boolean expression for the following circuits.

Gate Level Minimization

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

S1 Teknik Telekomunikasi Fakultas Teknik Elektro FEH2H3 2016/2017

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

CS8803: Advanced Digital Design for Embedded Hardware

CS470: Computer Architecture. AMD Quad Core

Karnaugh Maps. Kiril Solovey. Tel-Aviv University, Israel. April 8, Kiril Solovey (TAU) Karnaugh Maps April 8, / 22

2.6 BOOLEAN FUNCTIONS

Philadelphia University Student Name: Student Number:

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

Gate-Level Minimization

Chapter 2 Part 5 Combinational Logic Circuits

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

Combinational Logic Circuits

3.3 Hardware Karnaugh Maps

X Y Z F=X+Y+Z

ENGINEERS ACADEMY. 7. Given Boolean theorem. (a) A B A C B C A B A C. (b) AB AC BC AB BC. (c) AB AC BC A B A C B C.

Code No: R Set No. 1

2008 The McGraw-Hill Companies, Inc. All rights reserved.

Slides for Lecture 15

Code No: 07A3EC03 Set No. 1

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

UNIT-4 BOOLEAN LOGIC. NOT Operator Operates on single variable. It gives the complement value of variable.

Switching Theory And Logic Design UNIT-II GATE LEVEL MINIMIZATION

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

Gate-Level Minimization

Presentation 4: Programmable Combinational Devices

POWR IP PZ1/17

ENGIN 112. Intro to Electrical and Computer Engineering

Incompletely Specified Functions with Don t Cares 2-Level Transformation Review Boolean Cube Karnaugh-Map Representation and Methods Examples

Code No: R Set No. 1

Chapter 6. Logic Design Optimization Chapter 6

1. Mark the correct statement(s)

Boolean Analysis of Logic Circuits

MODULE 5 - COMBINATIONAL LOGIC

GATE Exercises on Boolean Logic

Code No: R Set No. 1

Lecture 5. Chapter 2: Sections 4-7

10EC33: DIGITAL ELECTRONICS QUESTION BANK

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

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

Transcription:

SEE223: Digital Electronics 3 Combinational Logic Design Zulkifil Md Yusof Dept. of Microelectronics and Computer Engineering The aculty of Electrical Engineering Universiti Teknologi Malaysia

Karnaugh Maps (K-Map) K-Map structure 2,3, and 4-variable Karnaugh Maps K-Map Grouping and Logic Simplification K-Map SOP and POS terms K-Map Don t Care Conditions Logic Design using K-Maps 2/8/22 A.A.H Ab-Rahman, Z.Md-Yusof 2

Introduction Karnaugh Map (K-Map) is a tool for simplifying digital logic with 2-6 variables K-Map, if properly used will produce the simplest SOP and POS expression possible, known as the minimum expression K-Map simplifies logic through SOP and POS boolean expressions, and truth table In this class, we ll look at logic simplification of 2, 3, and 4 variables 2/8/22 A.A.H Ab-Rahman, Z.Md-Yusof 3

2-variable K-Maps K-Map is a representation of a truth table, but can be used to obtain Boolean expressions (A,B) truth table A B 2-variable K-Map B A Cell location of each entry 2/8/22 A.A.H Ab-Rahman, Z.Md-Yusof 4

3-variable K-Map (A,B,C) truth table A B C 3-variable K-Map Gray code ordering BC A 2/8/22 A.A.H Ab-Rahman, Z.Md-Yusof 5

4-variable K-Map (A,B,C,D) truth table 4-variable K-Map A B C D A B C D CD 2/8/22 A.A.H Ab-Rahman, Z.Md-Yusof 6

K-Map Example Given the following standard form of SOP, complete the truth table and K-map A B C 2/8/22 A.A.H Ab-Rahman, Z.Md-Yusof 7 A BC

K-Map Example Given the following SOP expression, complete the K-Map BC D D D = when B = and C = ( st minterm) when A = and B = (2 nd minterm) when A =, B =, and C = (3 rd minterm) when A =, B =, C =, and D = (4 th minterm) when A =, B =, C =, and D = (5 th minterm) when A =, B =, C =, and D = (6 th minterm) CD 2/8/22 A.A.H Ab-Rahman, Z.Md-Yusof 8

K-Map Grouping After SOP expression has been mapped, minimum expression is obtained by grouping the s and determining the minimum SOP expression from the map When grouping the s, the goal is to maximize the size of the groups, and minimize the number of groups 2/8/22 A.A.H Ab-Rahman, Z.Md-Yusof 9

K-Map Grouping (cont.) Rules for grouping of s A group must contain either, 2, 4, 8, or 6 cells. or x-variable K-map, 2 x cells is maximum Each cell in a group must be adjacent to one or more cells in that same group, but all cells in the group don t have to be adjacent to each other Always include the largest possible number of s in a group Each on the map must be included in at least one group. The s already in a group can be included in another group as long as the overlapping groups include common s 2/8/22 A.A.H Ab-Rahman, Z.Md-Yusof

K-Map Minimum Product Term or 3-variable K-Map cell group yields a 3-variable product term 2 cell group yields a 2-variable product term 4 cell group yields a -variable product term 8 cell group yields a value of for the expression or 4-variable K-Map cell group yields a 4-variable product term 2 cell group yields a 3-variable product term 4 cell group yields a 2-variable product term 8 cell group yields a -variable product term 6- cell group yields a value of for the expression 2/8/22 A.A.H Ab-Rahman, Z.Md-Yusof

K-Map Simplification Group the s and find the minimum SOP expression in the K-Map below A BC BC BC Expression is minimized when taking large cell possible What is the SOP expression if each cell is taken as a group? 2/8/22 A.A.H Ab-Rahman, Z.Md-Yusof 2

K-Map Simplification ind the minimum SOP expression for the logic expression: ( A, B, C) A BC (3,5) C C 2/8/22 A.A.H Ab-Rahman, Z.Md-Yusof 3

K-Map Simplification Group the s and find the minimum SOP expression AC CD D AC D 2/8/22 A.A.H Ab-Rahman, Z.Md-Yusof 4

K-Map Simplification ind the minimum expression for the logic expression: ( A, B, C, D) BC CD (,2,4,5,6,8,,,2,3,4) D D BC 2/8/22 A.A.H Ab-Rahman, Z.Md-Yusof 5

Don t Care Conditions Don t Care is the condition when the output can either be or, which is denoted by x in the truth table or K-Map or both SOP and POS minimum expression, x can be included or ignored 2/8/22 A.A.H Ab-Rahman, Z.Md-Yusof 6

Don t Care Condition (cont.) ind minimum SOP expression for the following K-Map CD AD x x AD If the x is replaced by, find the minimum SOP expression AD D 2/8/22 A.A.H Ab-Rahman, Z.Md-Yusof 7