Question:Consider the expressions: (a)F = XY + XY' (b)B = XYZ + XYZ' + X'Y'Z + X'Y'Z' (c)D = W'X'Y'Z' + W'X'YZ' + W'XY'Z' + W'XYZ' Example For each of.

Slides:

Advertisements

Similar presentations

ECE 238L Computer Logic Design Spring 2010

Advertisements

Logic Functions Logical functions can be expressed in several ways: ▫ Truth table ▫ Logical expressions ▫ Graphical form prepared by:eng.Rula Amjed.

Table of Contents Factoring A Difference Of Squares Difference of Squares: A difference of squares is an algebraic expression of the form A 2 – B 2, where.

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.

Karnaugh Maps Discussion D3.1. Karnaugh Maps Minterm X Y F m m m m X Y F(X,Y) = m0 + m2 + m3 =  (0,2,3) = X + Y'

Gate-Level Minimization. Digital Circuits The Map Method The complexity of the digital logic gates the complexity of the algebraic expression.

Karnaugh Maps Discussion D6.2 Section Karnaugh Maps Minterm X Y F m m m m X Y F(X,Y) = m0 | m2 | m3 =  (0,2,3)

COMBINATIONAL LOGIC CIRCUITS C.L. x1 x2 xn Z Z = F (x1, x2, ……., Xn) F is a Binary Logic (BOOLEAN ) Function Knowing F Allows Straight Forward Direct Implementation.

Karnaugh Maps Discussion D6.2 Appendix H. Karnaugh Maps Minterm x y f m m m m x y f(x,y) = m0 | m2 | m3 =  (0,2,3)

EECC341 - Shaaban #1 Lec # 7 Winter Combinational Circuit Minimization Canonical sum and product logic expressions do not provide a circuit.

Simplifying Boolean Expressions Using K-Map Method

Erik Jonsson School of Engineering and Computer Science FEARLESS Engineeringwww.utdallas.edu/~pervin EE/CE 2310 – HON/002 Introduction to Digital Systems.

Boolean Algebra and Logic Simplification

Boolean Functions.

Logic Design CS221 1 st Term K-Map Cairo University Faculty of Computers and Information.

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.

KARNAUGH MAP – Digital Circuit 1 Choopan Rattanapoka.

Boolean Algebra and Digital Circuits

ECE 331 – Digital System Design

©2004 Brooks/Cole FIGURES FOR CHAPTER 2 BOOLEAN ALGEBRA Click the mouse to move to the next page. Use the ESC key to exit this chapter. This chapter in.

Gate-Level Minimization Chapter 3. Digital Circuits The Map Method The complexity of the digital logic gates the complexity of the algebraic expression.

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

ECE 2110: Introduction to Digital Systems PoS minimization Don’t care conditions.

Boolean Algebra Introduction Logical arguments are valid (or not) by virtue of their form, not content Example All men are mortal(premise 1) Harry is a.

Computer Engineering (Logic Circuits) (Karnaugh Map)

Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and

ECE 301 – Digital Electronics Basic Logic Operations, Boolean Expressions, and Boolean Algebra (Lecture #3)

1 EG 32 Digital Electronics Thought for the day You learn from your mistakes..... So make as many as you can and you will eventually know everything.

Computer Systems 1 Fundamentals of Computing Simplifying Boolean Expressions.

Minimization Karnaugh Maps

Conversion from one number base to another Binary arithmetic Equation simplification DeMorgan’s Laws Conversion to/from SOP/POS Reading equations from.

BOOLEAN ALGEBRA – Digital Circuit 1 Choopan Rattanapoka.

Module –I Boolean Algebra Digital Design Amit Kumar Assistant Professor SCSE, Galgotias University, Greater Noida.

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.

Karnaugh Map (K-Map) By Dr. M. Khamis Mrs. Dua’a Al Sinari.

CMPUT Computer Organization and Architecture II1 CMPUT329 - Fall 2003 Topic 4: Cost of Logic Circuits and Karnaugh Maps José Nelson Amaral.

Boolean Algebra. BOOLEAN ALGEBRA Formal logic: In formal logic, a statement (proposition) is a declarative sentence that is either true(1) or false (0).

Boolean Algebra ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.

Function Simplification. Outline  Function Simplification  Algebraic Simplification  Half Adder  Introduction to K-maps  Venn Diagrams.

Logic Gates, Boolean Algebra and Karnaugh Maps. Challenge! By the end of todays session can you complete the following?

Mu.com.lec 9. Overview Gates, latches, memories and other logic components are used to design computer systems and their subsystems Good understanding.

Table 2.1 Postulates and Theorems of Boolean Algebra

Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and

DIGITAL LOGIC CIRCUITS

EXAMPLES- Simplifying Radicals part 2

Logic Gates, Boolean Algebra and Karnaugh Maps

CHAPTER 2 Boolean Algebra

CHAPTER 2 Boolean Algebra This chapter in the book includes:

Princess Sumaya University

Algebra with Whole Numbers

Topic1: Boolean Algebra José Nelson Amaral

FIGURES FOR CHAPTER 2 BOOLEAN ALGEBRA

Gate-level Design: Full Adder

DIGITAL LOGIC CIRCUITS

Circuits & Boolean Expressions

Karnaugh Maps (K-Maps)

Combinational Logic Design Process

Example Question: Consider the expressions: (a) F = XY + XY'

Chapter 3 Gate-level Minimization.

Table 2.1 Postulates and Theorems of Boolean Algebra

University of Maryland Baltimore County Department of Computer Science and Electrical Engineering CMPE 212 Laboratory (Discussion 4) Hasib Hasan

Minimization of Switching Functions

Digital Logic Chapter-2

Digital Logic Chapter-2

Karnaugh maps Last time we saw applications of Boolean logic to circuit design. The basic Boolean operations are AND, OR and NOT. These operations can.

Analysis of Logic Circuits Example 1

Eng. Ahmed M Bader El-Din October, 2018

Circuits & Boolean Expressions

Presentation transcript:

Question:Consider the expressions: (a)F = XY + XY' (b)B = XYZ + XYZ' + X'Y'Z + X'Y'Z' (c)D = W'X'Y'Z' + W'X'YZ' + W'XY'Z' + W'XYZ' Example For each of these expressions, 1i.Build the truth table ii.Implement the logic circuit 2i.Simplify the expression using theorems of Boolean Algebra ii.Build the truth table (of the simplified expression) iii.Implement the logic circuit 3Simplify the expression using Karnaugh map

Question:(a)F = XY + XY' 1ii.Implement the logic circuit 1i.Build the truth table XYF XYF X Y Y' XY XY' F = XY + XY'

Question:(a)F = XY + XY' 2ii.Build the truth table (of the simplified expression) 2i.Simplify the expression using theorems of Boolean Algebra F=XY + XY' =X(Y + Y') =X. 1 =X XYF0x01x1XYF0x01x1 2iii.Implement the logic circuit XF = X

Question:(a)F = XY + XY' 3Simplify the expression using Karnaugh map 0 X Y F=XF=X

Question:(b) B = XYZ + XYZ' + X'Y'Z + X'Y'Z' 1i.Build the truth table XYZB XYZB

Question: (b) B = XYZ + XYZ' + X'Y'Z + X'Y'Z' 1ii.Implement the logic circuit XYZ X'Y'Z' B = XYZ + XYZ' + X'Y'Z + X'Y'Z' XYZ XYZ' X'Y'Z X'Y'Z'

Question:(b)B = XYZ + XYZ' + X'Y'Z + X'Y'Z' 2ii.Build the truth table (of the simplified expression) 2i.Simplify the expression using theorems of Boolean Algebra B=XYZ + XYZ' + X'Y'Z + X'Y'Z' =XY(Z + Z') + X'Y'(Z + Z') =XY + X'Y' XYZB00x101x010x011x1XYZB00x101x010x011x1

2iii.Implement the logic circuit Question:(b)B = XYZ + XYZ' + X'Y'Z + X'Y'Z' X Y Y' XY X'Y' B = XY + X'Y' X' 3Simplify the expression using Karnaugh map B=X'Y' + XY 1 X YZ

Question: (c)D = W'X'Y'Z' + W'X'YZ' + W'XY'Z' + W'XYZ' 1i.Build the truth table WXYZB WXYZB

Question: (c)D = W'X'Y'Z' + W'X'YZ' + W'XY'Z' + W'XYZ' 1ii.Implement the logic circuit

Question: (c)D = W'X'Y'Z' + W'X'YZ' + W'XY'Z' + W'XYZ' 2ii.Build the truth table (of the simplified expression) 2i.Simplify the expression using theorems of Boolean Algebra D=W'X'Y'Z' + W'X'YZ' + W'XY'Z' + W'XYZ' =W'Z'(X'Y' + X'Y + XY' + XY) =W'Z'((X'(Y' + Y) + X(Y' + Y)) =W'Z'(X' + X) =W'Z' WXYZD0xx010xx101xx001xx10WXYZD0xx010xx101xx001xx10

2iii.Implement the logic circuit Question: (c)D = W'X'Y'Z' + W'X'YZ' + W'XY'Z' + W'XYZ' 3Simplify the expression using Karnaugh map D=W'Z' W Z 1 WX YZ