Combinational Logic Circuits Part II -Theoretical Foundations

Size: px
Start display at page:

Download "Combinational Logic Circuits Part II -Theoretical Foundations"

Transcription

1 Combinational Logic Circuits Part II -Theoretical Foundations

2 Overview Boolean Algebra Basic Logic Operations Basic Identities Basic Principles, Properties, and Theorems Boolean Function and Representations Truth Table Canonical and Standard Forms Minterms and Maxterms Canonical Sum-Of-Products and Product-Of-Sums forms Standard Sum-Of-Products and Product-Of-Sums forms Conversions Karnaugh Map (K-Map) 2, 3, 4, and 5 variable K-maps Complement of a Boolean function Fall 27 Digital Technique by Todor Stefanov, Leiden University 2

3 Boolean Function Representations Truth Table (unique representation) Size of a truth table grows exponentially with the number of variables involved This motivates the use of other representations Boolean Equation Canonical Sum-Of-Products (CSOP) form (unique) Canonical Product-Of-Sums (CPOS) form (unique) Standard Forms (NOT unique representations) Map (unique representation) We can convert one representation of a Boolean function into another in a systematic way Fall 27 Digital Technique by Todor Stefanov, Leiden University 3

4 Canonical and Standard Forms Canonical and Standard forms of a Boolean functions are boolean equation representations To introduce them we need the following definitions: Literal: A variable or its complement Product term: literals connected by Sum term: literals connected by + Minterm: a product term in which all the variables appear exactly once, either complemented or uncomplemented Maxterm: a sum term in which all the variables appear exactly once, either complemented or uncomplemented Fall 27 Digital Technique by Todor Stefanov, Leiden University 4

5 Minterm: Characteristic Property A minterm of N variables defines a boolean function that represents exactly one combination (b j ) of the binary variables in the truth table The function has value for this combination and value for all others There are 2 N distinct minterms for N variables A minterm is denoted by m j j is the decimal equivalent of the minterm s corresponding binary combination (b j ) A variable in m j is complemented if its value in (b j ) is, otherwise it is uncomplemented Fall 27 Digital Technique by Todor Stefanov, Leiden University 5

6 Minterms for Three Variables For 3 variables,, Z there are 2 3 minterms (products of 3 literals): m = Z m = Z m 2 = Z m 3 = Z m 4 = Z m 5 = Z m 6 = Z m 7 = Z Example: consider minterm m 5 : m 5 defines a boolean function that represents exactly one combination (b 5 =) the function has value for this combination and value for all others variable in m 5 is complemented because its value in b 5 is Z m m m 2 m 3 m 4 m 5 m 6 m 7 b b b 2 b 3 b 4 b 5 b 6 b 7 Fall 27 Digital Technique by Todor Stefanov, Leiden University 6

7 Maxterm: Characteristic Property A maxterm of N variables defines a boolean function that represents exactly one combination (b j ) of the binary variables in the truth table The function has value for this combination and value for all others There are 2 N distinct maxterms for N variables A maxterm is denoted by M j j is the decimal equivalent of the maxterm s corresponding binary combination (b j ) A variable in M j is complemented if its value in (b j ) is, otherwise it is uncomplemented Fall 27 Digital Technique by Todor Stefanov, Leiden University 7

8 Maxterms for Three Variables For 3 variables,, Z there are 2 3 maxterms (sums of 3 literals): M = ++Z M = ++Z M 2 = + +Z M 3 = + +Z M 4 = ++Z M 5 = ++Z M 6 = + +Z M 7 = + +Z Example: consider maxterm M 5 : M 5 defines a boolean function that represents exactly one combination (b 5 =) the function has value for this combination and value for all others variables and in M 5 are complemented because their values in b 5 are Z M M M 2 M 3 M 4 M 5 M 6 M 7 b b b 2 b 3 b 4 b 5 b 6 b 7 Fall 27 Digital Technique by Todor Stefanov, Leiden University 8

9 Canonical Forms (Unique) Any Boolean function F( ) can be expressed as: a unique sum of minterms a unique product of maxterms In other words, every function F( ) has two canonical forms: Canonical Sum-Of-Products (CSOP) (sum of minterms) Canonical Product-Of-Sums (CPOS) (product of maxterms) The words product and sum do not imply arithmetic operations in Boolean algebra! they specify the logical operations AND and OR, respectively Fall 27 Digital Technique by Todor Stefanov, Leiden University 9

10 Canonical Sum-Of-Products It is a sum of minterms The minterms included are those m j such that F( ) = in row j of the truth table for F( ) Example: Truth table for F(,,Z) at right The canonical sum-of-products form for F is: F(,,Z) = m + m 2 + m 4 + m 6 = = Z + Z + Z + Z Z F m = Z m 2 = Z m 4 = Z m 6 =Z Fall 27 Digital Technique by Todor Stefanov, Leiden University

11 Canonical Product-Of-Sums It is a product of maxterms The maxterms included are those M j such that F( ) = in row j of the truth table for F( ) Example: Truth table for F(,,Z) at right The canonical product-of-sums form for F is: F(,,Z) = M M 3 M 5 M 7 = = (++Z) (+ +Z ) ( ++Z ) ( + +Z ) Z F M =++Z M 3 =+ +Z M 5 = ++Z M 7 = + +Z Fall 27 Digital Technique by Todor Stefanov, Leiden University

12 Shorthand: and F(,,Z) = m + m 2 + m 4 + m 6 = = Z + Z + Z + Z = = m(,2,4,6), indicates that this is a sum-of-products form m(,2,4,6) indicates to included minterms m, m 2, m 4, and m 6 F(,,Z) = M M 3 M 5 M 7 = = (++Z) (+ +Z ) ( ++Z ) ( + +Z ) = = M(,3,5,7), indicates that this is a product-of-sums form M(,3,5,7) indicates to included maxterms M, M 3, M 5, and M 7 m(,2,4,6) = M(,3,5,7) = F(,,Z) Fall 27 Digital Technique by Todor Stefanov, Leiden University 2

13 Conversion Between Canonical Forms Get the shorthand notation Replace with (or vice versa) Replace those j s that appeared in the original form with those that do not Example: F(,,Z) = Z + Z + Z + Z = m + m 2 + m 4 + m 6 = m(,2,4,6) = M(,3,5,7) = (++Z) (+ +Z ) ( ++Z ) ( + +Z ) Fall 27 Digital Technique by Todor Stefanov, Leiden University 3

14 Standard Forms (NOT Unique) There are two types of standard forms: Sum-of-Products (SOP) forms (NOT unique) Product-of-Sums (POS) form (NOT unique) In standard forms, not all variables need to appear in the individual product or sum terms! Example: F(,,Z) = Z + Z + Z F(,,Z) = Z + Z + Z are two standard sum-of-products forms Example2: F(,,Z) = (++Z) (+ +Z ) ( + Z ) F(,,Z) = (++Z) ( +Z ) ( + Z ) are tow standard product-of-sums form Z F Fall 27 Digital Technique by Todor Stefanov, Leiden University 4

15 Conversion from Standard to Canonical SOP form Expand non-canonical product terms by inserting equivalent of for each missing variable V: (V + V ) = Remove duplicate minterms Example: F(,,Z) = Z + Z + Z = = Z + (+ )Z + (+ )Z = Z + Z + Z + Z + Z = Z + Z + Z + Z Can you do it: F(,,Z) = Z + Z + Z Z F Fall 27 Digital Technique by Todor Stefanov, Leiden University 5

16 Conversion from Standard to Canonical POS form Expand non-canonical sum terms by adding for each missing variable: V V = Remove duplicate maxterms Example: F(,,Z) = (++Z) ( +Z ) ( +Z ) = = (++Z) ( + +Z ) ( + +Z ) = (++Z) (+ +Z ) ( + +Z ) ( ++Z ) ( + +Z ) = (++Z) (+ +Z ) ( + +Z ) ( ++Z ) Can you do it for: F(,,Z) = (++Z) (+ +Z ) ( + Z ) Z F Fall 27 Digital Technique by Todor Stefanov, Leiden University 6

17 Karnaugh Maps (Unique) A Karnaugh map (K-map) is a unique graphical representation of a Boolean functions K-map of a Boolean function of N variables consists of 2 N cells One map cell corresponds to a row in the truth table Also, one map cell corresponds to a minterm in the Boolean function Multiple-cell areas of the map correspond to standard terms The K-map representation is useful for Boolean functions of up to 5 variables Fall 27 Digital Technique by Todor Stefanov, Leiden University 7

18 Two-Variable K-map 2 3 F(,) F(,) F(,) F(,) F(,) F(,) F(,) m = m = F(,) F(,) m 2 = m 3 = Cell corresponds to row in the truth table and represents minterm ; Cell corresponds to row and represents ; etc. If Boolean function F(,) has value in a row of the truth table, i.e., a minterm is present in the function, then a is placed in the corresponding cell. Fall 27 Digital Technique by Todor Stefanov, Leiden University 8

19 Two-Variable K-map -- Examples Truth Table K - map Canonical and Standard SOP F F2 F3 F4 F = m 3 = F2 = m 2 + m 3 = + = F3 = m + m 2 = + F4 = m + m + m 3 = + + = + (canonical) (canonical) (standard) (canonical) (canonical) (standard) Fall 27 Digital Technique by Todor Stefanov, Leiden University 9

20 Two-Variable K-map (cont.) Any two adjacent cells in the map differ by ONL one variable appears complemented in one cell and uncomplemented in the other Example: m (= ) is adjacent to m (= ) and m 2 (= ) but NOT m 3 (=) Multiple-cell areas of the map correspond to standard terms Examples: 2-cell area m 2 m 3 corresponds to term : m 2 + m 3 = + = ( +) = 4-cell area m m corresponds to constant : m 2 m 3 m + m + m 2 + m 3 = = = ( +) + ( +) = + = Fall 27 Digital Technique by Todor Stefanov, Leiden University 2 m = m 2 = m = m 2 = m = m 3 = m = m 3 =

21 Three-Variable K-map Z F(,,Z) F(,,) F(,,) F(,,) F(,,) F(,,) F(,,) F(,,) F(,,) Cell corresponds to row in the truth table and represents minterm Z ; Cell corresponds to row and represents Z; etc. If F(,,Z) has value in a row of the truth table, i.e., a minterm is present in the function, then a is placed in the corresponding cell. Fall 27 Digital Technique by Todor Stefanov, Leiden University 2 Z Z F(,,) 4 5 Z F(,,) F(,,) F(,,) F(,,) F(,,) F(,,) F(,,) m = Z 4 5 Z m = Z m 3 = Z m 2 = Z m 4 = Z m 5 = Z m 7 =Z m 6 =Z

22 Three-Variable K-map -- Examples Truth Table K - map Canonical and Standard SOP Z F Z Z F = m + m 3 + m 5 + m 6 = = Z + Z + Z + Z (canonical) Z F2 Z Z F2 = m + m 2 + m 3 + m 6 + m 7 = = Z + Z + Z + Z + Z = Z + (canonical) (standard) Fall 27 Digital Technique by Todor Stefanov, Leiden University 22

23 Three-Variable K-map (cont.) Z m = Z m = Z m 3 = Z m 2 = Z m 4 = Z m 5 = Z m 7 =Z m 6 =Z Z NOTE: variable ordering is important assume function F(,,Z) then specifies the rows in the map and Z the columns Each cell is adjacent to three other cells (left, right, up or down). Left-edge cells are adjacent to right-edge cells! One cell represents a minterm of 3 literals A rectangle of 2 adjacent cells represents a product term of 2 literals A rectangle of 4 cells represents a product term of literal A rectangle of 8 cells encompasses the entire map and produces a function that is equal to logic Fall 27 Digital Technique by Todor Stefanov, Leiden University 23

24 W Four-Variable K-map Z F(W,,,Z) F(,,,) F(,,,) F(,,,) F(,,,) F(,,,) F(,,,) F(,,,) F(,,,) F(,,,) F(,,,) F(,,,) F(,,,) F(,,,) F(,,,) F(,,,) F(,,,) Z W W 3 m =W Z m =W Z Cell corresponds to row in the truth table and represents minterm W Z ; Cell corresponds to row and represents W Z; etc. If F(W,,,Z) has value in a row of the truth table, i.e., a minterm is present in the function, then a is placed in the corresponding cell. Fall 27 Digital Technique by Todor Stefanov, Leiden University m 4 =W Z m 5 =W Z m 7 =W Z 2 m 2 =W Z m 3 =W Z 3 5 m 3 =W Z m 5 =WZ 8 9 m 8 =W Z m 9 =W Z m =W Z Z 2 4 m 2 =W Z m 6 =W Z m 4 =WZ m =W Z

25 W Four-Variable K-map -- Examples Z F Truth Table K - map Z W W Fall 27 Digital Technique by Todor Stefanov, Leiden University 25 F = m + m 2 + m 3 + Z m 8 + m 9 + m + m + m 2 + m 3 + m 4 + m 5 = = W Z + W Z + W Z + W Z + W Z + W Z + W Z + W Z + W Z + WZ + WZ = W Z + W Z + W Z + W Z + W Z + W Z + W Z + W Z + W Z + WZ + WZ = W Z + + W Z + W Z + W Z + W Z + W Z + W Z + WZ + WZ = W Z + + W K - map Canonical and Standard SOP (canonical form) (standard form) (standard form) (standard form)

26 W Z W Four-Variable K-map (cont.) m 3 m m 3 W Z W Z W Z W Z m 4 m 5 m 7 W Z W Z W Z m 2 m 3 m 5 2 m 2 m 6 W Z 4 m 4 W Z W Z WZ WZ 8 m 9 m 8 9 m m W Z W Z W Z W Z Z NOTE: variable ordering is important assume function F(W,,,Z) then W specifies the rows in the map and Z the columns Each cell is adjacent to four cells (left, right, up, down) Top cells are adjacent to bottom cells; Left-edge cells are adjacent to right-edge cells One cell represents a minterm of 4 literals A rectangle of 2 adjacent cells represents a product term of 3 literals A rectangle of 4 cells represents a product term of 2 literals A rectangle of 8 cells represents a product term of literal A rectangle of 6 cells produces a function that is equal to logic Fall 27 Digital Technique by Todor Stefanov, Leiden University 26

27 Five-Variable K-map F(T,W,,,Z) Z W Z W T= TWZ T= T WZ Can you draw six-variable K-map? Fall 27 Digital Technique by Todor Stefanov, Leiden University 27

28 Complement of a Boolean Function The complement representation of function F is denoted as F F can be obtained by interchanging s to s and s to s in the column showing F of the truth table F can be derived by applying DeMorgan s theorem on F F can be derived by taking the dual of F, i.e., interchanging with +, and with in F and complementing each literal The complement of a function IS NOT THE SAME as the dual of the function Fall 27 Digital Technique by Todor Stefanov, Leiden University 28

29 Complementation: Example Consider function F(,,Z) = Z + Z Table method Z F F DeMorgan method: F = ( Z + Z ) -- apply DeMorgan = ( Z ) ( Z ) -- DeMorgan again = (+ +Z) ( ++Z) Dual method: F = Z + Z -- interchange with + to find the dual of F G = ( ++Z ) (+ +Z ) G is the dual of F -- complement each literal to find F F = (+ +Z) ( ++Z) Fall 27 Digital Technique by Todor Stefanov, Leiden University 29

This form sometimes used in logic circuit, example:

This form sometimes used in logic circuit, example: Objectives: 1. Deriving of logical expression form truth tables. 2. Logical expression simplification methods: a. Algebraic manipulation. b. Karnaugh map (k-map). 1. Deriving of logical expression from

More information

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

Ex: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC. Boolean Expression Forms: Sum-of-products (SOP) Write an AND term for each input combination that produces a 1 output. Write the input variable if its value is 1; write its complement otherwise. OR the

More information

Computer Organization I

Computer Organization I Computer Organization I Lecture 6: Boolean Algebra /2/29 Wei Lu CS283 Overview Two Principles in Boolean Algebra () Duality Principle (2) Complement Principle Standard Form of Logic Expression () Sum of

More information

Boolean Algebra and Logic Simplification

Boolean Algebra and Logic Simplification S302 Digital Logic Design Boolean Algebra and Logic Simplification Boolean Analysis of Logic ircuits, evaluating of Boolean expressions, representing the operation of Logic circuits and Boolean expressions

More information

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

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering Boolean Algebra Boolean Algebra A Boolean algebra is defined with: A set of

More information

Digital Systems and Information Part II

Digital Systems and Information Part II Digital Systems and Information Part II Overview Arithmetic Operations General Remarks Unsigned and Signed Binary Operations Number representation using Decimal Codes BCD code and Seven-Segment Code Text

More information

211: Computer Architecture Summer 2016

211: Computer Architecture Summer 2016 211: Computer Architecture Summer 2016 Liu Liu Topic: Storage Project3 Digital Logic - Storage: Recap - Review: cache hit rate - Project3 - Digital Logic: - truth table => SOP - simplification: Boolean

More information

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

EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive March 30, 2010 John Wawrzynek Spring 2010 EECS150 - Lec19-cl1 Page 1 Boolean Algebra I (Representations of Combinational

More information

Minimization techniques

Minimization techniques Pune Vidyarthi Griha s COLLEGE OF ENGINEERING, NSIK - 4 Minimization techniques By Prof. nand N. Gharu ssistant Professor Computer Department Combinational Logic Circuits Introduction Standard representation

More information

CPE100: Digital Logic Design I

CPE100: Digital Logic Design I Chapter 2 Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu http://www.ee.unlv.edu/~b1morris/cpe100/ CPE100: Digital Logic Design I Section 1004: Dr. Morris Combinational Logic Design Chapter

More information

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

BOOLEAN ALGEBRA CLASS XII. Presented By : Dinesh Patel PGT CS KV IIT Powai BOOLEAN ALGEBRA CLASS II Presented By : Dinesh Patel PGT CS KV IIT Powai Introduction Boolean Algebra is a set of rules and regulation which is suitable for Digital Circuits, whose answer is either True

More information

Digital Logic Design. Malik Najmus Siraj

Digital Logic Design. Malik Najmus Siraj Digital Logic Design Malik Najmus Siraj siraj@case.edu.pkedu LECTURE 4 Today s Agenda Recap 2 s complement Binary Logic Boolean algebra Recap Computer Arithmetic Signed numbers Radix and diminished radix

More information

Standard Expression Forms

Standard Expression Forms ThisLecture will cover the following points: Canonical and Standard Forms MinTerms and MaxTerms Digital Logic Families 24 March 2010 Standard Expression Forms Two standard (canonical) expression forms

More information

MC9211 Computer Organization

MC9211 Computer Organization MC92 Computer Organization Unit : Digital Fundamentals Lesson2 : Boolean Algebra and Simplification (KSB) (MCA) (29-2/ODD) (29 - / A&B) Coverage Lesson2 Introduces the basic postulates of Boolean Algebra

More information

Chapter 2 Combinational Logic Circuits

Chapter 2 Combinational Logic Circuits Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active

More information

Chapter 2: Princess Sumaya Univ. Computer Engineering Dept.

Chapter 2: Princess Sumaya Univ. Computer Engineering Dept. hapter 2: Princess Sumaya Univ. omputer Engineering Dept. Basic Definitions Binary Operators AND z = x y = x y z=1 if x=1 AND y=1 OR z = x + y z=1 if x=1 OR y=1 NOT z = x = x z=1 if x=0 Boolean Algebra

More information

Lecture 4: More Boolean Algebra

Lecture 4: More Boolean Algebra Lecture 4: More Boolean Algebra Syed M. Mahmud, Ph.D ECE Department Wayne State University Original Source: Prof. Russell Tessier of University of Massachusetts Aby George of Wayne State University ENGIN2

More information

CHAPTER III BOOLEAN ALGEBRA

CHAPTER III BOOLEAN ALGEBRA CHAPTER III- CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III-2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.

More information

Chapter 7 Logic Circuits

Chapter 7 Logic Circuits Chapter 7 Logic Circuits Goal. Advantages of digital technology compared to analog technology. 2. Terminology of Digital Circuits. 3. Convert Numbers between Decimal, Binary and Other forms. 5. Binary

More information

CHAPTER III BOOLEAN ALGEBRA

CHAPTER III BOOLEAN ALGEBRA CHAPTER III- CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III-2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.

More information

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

Simplification of Boolean Functions. Dept. of CSE, IEM, Kolkata Simplification of Boolean Functions Dept. of CSE, IEM, Kolkata 1 Simplification of Boolean Functions: An implementation of a Boolean Function requires the use of logic gates. A smaller number of gates,

More information

Chapter 2 Boolean Algebra and Logic Gates

Chapter 2 Boolean Algebra and Logic Gates Chapter 2 Boolean Algebra and Logic Gates Huntington Postulates 1. (a) Closure w.r.t. +. (b) Closure w.r.t.. 2. (a) Identity element 0 w.r.t. +. x + 0 = 0 + x = x. (b) Identity element 1 w.r.t.. x 1 =

More information

ELCT201: DIGITAL LOGIC DESIGN

ELCT201: DIGITAL LOGIC DESIGN ELCT2: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 2 Following the slides of Dr. Ahmed H. Madian ذو الحجة 438 ه Winter

More information

Chapter 2 : Boolean Algebra and Logic Gates

Chapter 2 : Boolean Algebra and Logic Gates Chapter 2 : Boolean Algebra and Logic Gates By Electrical Engineering Department College of Engineering King Saud University 1431-1432 2.1. Basic Definitions 2.2. Basic Theorems and Properties of Boolean

More information

Digital Logic Design. Combinational Logic

Digital Logic Design. Combinational Logic Digital Logic Design Combinational Logic Minterms A product term is a term where literals are ANDed. Example: x y, xz, xyz, A minterm is a product term in which all variables appear exactly once, in normal

More information

WEEK 2.1 BOOLEAN ALGEBRA

WEEK 2.1 BOOLEAN ALGEBRA WEEK 2.1 BOOLEAN ALGEBRA 1 Boolean Algebra Boolean algebra was introduced in 1854 by George Boole and in 1938 was shown by C. E. Shannon to be useful for manipulating Boolean logic functions. The postulates

More information

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

II. COMBINATIONAL LOGIC DESIGN. - algebra defined on a set of 2 elements, {0, 1}, with binary operators multiply (AND), add (OR), and invert (NOT): ENGI 386 Digital Logic II. COMBINATIONAL LOGIC DESIGN Combinational Logic output of digital system is only dependent on current inputs (i.e., no memory) (a) Boolean Algebra - developed by George Boole

More information

Unit 2 Session - 6 Combinational Logic Circuits

Unit 2 Session - 6 Combinational Logic Circuits Objectives Unit 2 Session - 6 Combinational Logic Circuits Draw 3- variable and 4- variable Karnaugh maps and use them to simplify Boolean expressions Understand don t Care Conditions Use the Product-of-Sums

More information

Chapter 2 Boolean Algebra and Logic Gates

Chapter 2 Boolean Algebra and Logic Gates Ch1: Digital Systems and Binary Numbers Ch2: Ch3: Gate-Level Minimization Ch4: Combinational Logic Ch5: Synchronous Sequential Logic Ch6: Registers and Counters Switching Theory & Logic Design Prof. Adnan

More information

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

The Karnaugh Map COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals The Karnaugh Map COE 202 Digital Logic Design Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals Presentation Outline Boolean Function Minimization The Karnaugh Map (K-Map) Two, Three,

More information

DIGITAL ELECTRONICS & it0203 Semester 3

DIGITAL ELECTRONICS & it0203 Semester 3 DIGITAL ELECTRONICS & it0203 Semester 3 P.Rajasekar & C.M.T.Karthigeyan Asst.Professor SRM University, Kattankulathur School of Computing, Department of IT 8/22/2011 1 Disclaimer The contents of the slides

More information

Chapter 5. Karnaugh Map and Minimization Procedures

Chapter 5. Karnaugh Map and Minimization Procedures hapter 5 Karnaugh Map and Minimization Procedures Lesson 1 KARNAUGH MAP h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 2 Outline Three variable Karnaugh map Four variable Karnaugh

More information

Logic Design. Chapter 2: Introduction to Logic Circuits

Logic Design. Chapter 2: Introduction to Logic Circuits Logic Design Chapter 2: Introduction to Logic Circuits Introduction Logic circuits perform operation on digital signal Digital signal: signal values are restricted to a few discrete values Binary logic

More information

WEEK 3.1 MORE ON KARNAUGH MAPS

WEEK 3.1 MORE ON KARNAUGH MAPS WEEK 3. MORE ON KARNAUGH MAPS Don t Cares Sometimes, we might have inputs and it doesn t matter what the output is; i.e., we don t care what the output is. These situations are called don t cares. Rather

More information

Simplifying Logic Circuits with Karnaugh Maps

Simplifying Logic Circuits with Karnaugh Maps Simplifying Logic Circuits with Karnaugh Maps The circuit at the top right is the logic equivalent of the Boolean expression: f = abc + abc + abc Now, as we have seen, this expression can be simplified

More information

ENG2410 Digital Design Combinational Logic Circuits

ENG2410 Digital Design Combinational Logic Circuits ENG240 Digital Design Combinational Logic Circuits Fall 207 S. Areibi School of Engineering University of Guelph Binary variables Binary Logic Can be 0 or (T or F, low or high) Variables named with single

More information

If f = ABC + ABC + A B C then f = AB C + A BC + AB C + A BC + A B C

If f = ABC + ABC + A B C then f = AB C + A BC + AB C + A BC + A B C Examples: If f 5 = AB + AB then f 5 = A B + A B = f 10 If f = ABC + ABC + A B C then f = AB C + A BC + AB C + A BC + A B C In terms of a truth table, if f is the sum (OR) of all the minterms with a 1 in

More information

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

Theorem/Law/Axioms Over (.) Over (+) material prepared by: MUKESH OHR Follow me on F : http://www.facebook.com/mukesh.sirji4u OOLEN LGER oolean lgebra is a set of rules, laws and theorems by which logical operations can be mathematically

More information

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

Lecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps EE210: Switching Systems Lecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps Prof. YingLi Tian Feb. 21/26, 2019 Department of Electrical Engineering The City College of New York

More information

Goals for Lecture. Binary Logic and Gates (MK 2.1) Binary Variables. Notation Examples. Logical Operations

Goals for Lecture. Binary Logic and Gates (MK 2.1) Binary Variables. Notation Examples. Logical Operations Introduction to Electrical Engineering, II LETURE NOTES #2 Instructor: Email: Telephone: Office: ndrew. Kahng (lecture) abk@ucsd.edu 858-822-4884 office 3802 P&M lass Website: http://vlsicad.ucsd.edu/courses/ece20b/wi04/

More information

Lecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions

Lecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions EE210: Switching Systems Lecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions Prof. YingLi Tian Feb. 15, 2018 Department of Electrical Engineering The City College of New York The

More information

Chapter-2 BOOLEAN ALGEBRA

Chapter-2 BOOLEAN ALGEBRA Chapter-2 BOOLEAN ALGEBRA Introduction: An algebra that deals with binary number system is called Boolean Algebra. It is very power in designing logic circuits used by the processor of computer system.

More information

CS 226: Digital Logic Design

CS 226: Digital Logic Design CS 226: Digital Logic Design 0 1 1 I S 0 1 0 S Department of Computer Science and Engineering, Indian Institute of Technology Bombay. 1 of 29 Objectives In this lecture we will introduce: 1. Logic functions

More information

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

Lecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University Lecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University Original Source: Aby K George, ECE Department, Wayne State University Contents The Map method Two variable

More information

CS 121 Digital Logic Design. Chapter 2. Teacher Assistant. Hanin Abdulrahman

CS 121 Digital Logic Design. Chapter 2. Teacher Assistant. Hanin Abdulrahman CS 121 Digital Logic Design Chapter 2 Teacher Assistant Hanin Abdulrahman 1 2 Outline 2.2 Basic Definitions 2.3 Axiomatic Definition of Boolean Algebra. 2.4 Basic Theorems and Properties 2.5 Boolean Functions

More information

Part 5: Digital Circuits

Part 5: Digital Circuits Characteristics of any number system are: Part 5: Digital Circuits 5.: Number Systems & Code Conversions. ase or radix is equal to the number of possible symbols in the system 2. The largest value of digit

More information

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

Why digital? Overview. Number Systems. Binary to Decimal conversion Why digital? Overview It has the following advantages over analog. It can be processed and transmitted efficiently and reliably. It can be stored and retrieved with greater accuracy. Noise level does not

More information

Administrative Notes. Chapter 2 <9>

Administrative Notes. Chapter 2 <9> Administrative Notes Note: New homework instructions starting with HW03 Homework is due at the beginning of class Homework must be organized, legible (messy is not), and stapled to be graded Chapter 2

More information

ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2

ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2 ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2 Instructor: Andrew B. Kahng (lecture) Email: abk@ucsd.edu Telephone: 858-822-4884 office, 858-353-0550 cell Office: 3802

More information

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

14:332:231 DIGITAL LOGIC DESIGN. Combinational Circuit Synthesis :: DIGITAL LOGIC DESIGN Ivan Marsic, Rutgers University Electrical & Computer Engineering all Lecture #: Combinational Circuit Synthesis I Combinational Circuit Synthesis Recall: Combinational circuit

More information

Digital Circuit And Logic Design I. Lecture 3

Digital Circuit And Logic Design I. Lecture 3 Digital Circuit And Logic Design I Lecture 3 Outline Combinational Logic Design Principles (). Introduction 2. Switching algebra 3. Combinational-circuit analysis 4. Combinational-circuit synthesis Panupong

More information

Combinational Logic. Review of Combinational Logic 1

Combinational Logic. Review of Combinational Logic 1 Combinational Logic! Switches -> Boolean algebra! Representation of Boolean functions! Logic circuit elements - logic gates! Regular logic structures! Timing behavior of combinational logic! HDLs and combinational

More information

Slides for Lecture 10

Slides for Lecture 10 Slides for Lecture 10 ENEL 353: Digital Circuits Fall 2013 Term Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary 30 September, 2013 ENEL 353

More information

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

Learning Objectives 10/7/2010. CE 411 Digital System Design. Fundamental of Logic Design. Review the basic concepts of logic circuits. Dr. /7/ CE 4 Digital ystem Design Dr. Arshad Aziz Fundamental of ogic Design earning Objectives Review the basic concepts of logic circuits Variables and functions Boolean algebra Minterms and materms ogic

More information

Boolean Algebra & Logic Gates. By : Ali Mustafa

Boolean Algebra & Logic Gates. By : Ali Mustafa Boolean Algebra & Logic Gates By : Ali Mustafa Digital Logic Gates There are three fundamental logical operations, from which all other functions, no matter how complex, can be derived. These Basic functions

More information

Chapter 2. Boolean Algebra and Logic Gates

Chapter 2. Boolean Algebra and Logic Gates Chapter 2 Boolean Algebra and Logic Gates Basic Definitions A binary operator defined on a set S of elements is a rule that assigns, to each pair of elements from S, a unique element from S. The most common

More information

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

2009 Spring CS211 Digital Systems & Lab CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS What will we learn? 2 Logic functions and circuits Boolean Algebra Logic gates and Synthesis CAD tools and VHDL Read Section 2.9 and 2.0 Terminology 3 Digital

More information

Combinational Logic Fundamentals

Combinational Logic Fundamentals Topic 3: Combinational Logic Fundamentals In this note we will study combinational logic, which is the part of digital logic that uses Boolean algebra. All the concepts presented in combinational logic

More information

BOOLEAN ALGEBRA TRUTH TABLE

BOOLEAN ALGEBRA TRUTH TABLE BOOLEAN ALGEBRA TRUTH TABLE Truth table is a table which represents all the possible values of logical variables / statements along with all the possible results of the given combinations of values. Eg:

More information

Digital Circuit And Logic Design I. Lecture 4

Digital Circuit And Logic Design I. Lecture 4 Digital Circuit And Logic Design I Lecture 4 Outline Combinational Logic Design Principles (2) 1. Combinational-circuit minimization 2. Karnaugh maps 3. Quine-McCluskey procedure Panupong Sornkhom, 2005/2

More information

Number System conversions

Number System conversions Number System conversions Number Systems The system used to count discrete units is called number system. There are four systems of arithmetic which are often used in digital electronics. Decimal Number

More information

Chapter 2 Combinational Logic Circuits

Chapter 2 Combinational Logic Circuits Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Goal: To obtain the simplest implementation for a given function Optimization is a more formal

More information

Cover Sheet for Lab Experiment #3

Cover Sheet for Lab Experiment #3 The University of Toledo EECS:1100 R2 Digital Logic Design Dr. Anthony D. Johnson Cover Sheet for Lab Experiment #3 Student Names Course Section Anthony Phillips 003 Alexander Beck 003 Report turned in

More information

UNIT 4 MINTERM AND MAXTERM EXPANSIONS

UNIT 4 MINTERM AND MAXTERM EXPANSIONS UNIT 4 MINTERM AND MAXTERM EXPANSIONS Spring 2 Minterm and Maxterm Expansions 2 Contents Conversion of English sentences to Boolean equations Combinational logic design using a truth table Minterm and

More information

Advanced Digital Design with the Verilog HDL, Second Edition Michael D. Ciletti Prentice Hall, Pearson Education, 2011

Advanced Digital Design with the Verilog HDL, Second Edition Michael D. Ciletti Prentice Hall, Pearson Education, 2011 Problem 2-1 Recall that a minterm is a cube in which every variable appears. A Boolean expression in SOP form is canonical if every cube in the expression has a unique representation in which all of the

More information

CHAPTER1: Digital Logic Circuits Combination Circuits

CHAPTER1: Digital Logic Circuits Combination Circuits CS224: Computer Organization S.KHABET CHAPTER1: Digital Logic Circuits Combination Circuits 1 PRIMITIVE LOGIC GATES Each of our basic operations can be implemented in hardware using a primitive logic gate.

More information

Chapter 2: Boolean Algebra and Logic Gates

Chapter 2: Boolean Algebra and Logic Gates Chapter 2: Boolean Algebra and Logic Gates Mathematical methods that simplify binary logics or circuits rely primarily on Boolean algebra. Boolean algebra: a set of elements, a set of operators, and a

More information

Functions. Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways:

Functions. Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: Boolean Algebra (1) Functions Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: An expression is finite but not unique f(x,y)

More information

Combinational Logic Design/Circuits

Combinational Logic Design/Circuits 3 ` Combinational Logic Design/Circuits Chapter-3(Hours : 12 Marks:24 ) Combinational Logic design / Circuits 3.1 Simplification of Boolean expression using Boolean algebra. 3.2 Construction of logical

More information

Karnaugh Map & Boolean Expression Simplification

Karnaugh Map & Boolean Expression Simplification Karnaugh Map & Boolean Expression Simplification Mapping a Standard POS Expression For a Standard POS expression, a 0 is placed in the cell corresponding to the product term (maxterm) present in the expression.

More information

Chapter 4 Optimized Implementation of Logic Functions

Chapter 4 Optimized Implementation of Logic Functions Chapter 4 Optimized Implementation of Logic Functions Logic Minimization Karnaugh Maps Systematic Approach for Logic Minimization Minimization of Incompletely Specified Functions Tabular Method for Minimization

More information

Introduction to Digital Logic Missouri S&T University CPE 2210 Karnaugh Maps

Introduction to Digital Logic Missouri S&T University CPE 2210 Karnaugh Maps Introduction to Digital Logic Missouri S&T University CPE 2210 Karnaugh Maps Egemen K. Çetinkaya Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of Science and Technology

More information

Combinational Logic Design Principles

Combinational Logic Design Principles Combinational Logic Design Principles Switching algebra Doru Todinca Department of Computers Politehnica University of Timisoara Outline Introduction Switching algebra Axioms of switching algebra Theorems

More information

Lecture 2 Review on Digital Logic (Part 1)

Lecture 2 Review on Digital Logic (Part 1) Lecture 2 Review on Digital Logic (Part 1) Xuan Silvia Zhang Washington University in St. Louis http://classes.engineering.wustl.edu/ese461/ Grading Engagement 5% Review Quiz 10% Homework 10% Labs 40%

More information

Review. EECS Components and Design Techniques for Digital Systems. Lec 06 Minimizing Boolean Logic 9/ Review: Canonical Forms

Review. EECS Components and Design Techniques for Digital Systems. Lec 06 Minimizing Boolean Logic 9/ Review: Canonical Forms Review EECS 150 - Components and Design Techniques for Digital Systems Lec 06 Minimizing Boolean Logic 9/16-04 David Culler Electrical Engineering and Computer Sciences University of California, Berkeley

More information

ENGR 303 Introduction to Logic Design Lecture 3. Dr. Chuck Brown Engineering and Computer Information Science Folsom Lake College

ENGR 303 Introduction to Logic Design Lecture 3. Dr. Chuck Brown Engineering and Computer Information Science Folsom Lake College Introduction to Logic Design Lecture 3 Dr. Chuck rown Engineering and Computer Information Science Folsom Lake College Outline for Todays Lecture Logic Circuits SOP / POS oolean Theorems DeMorgan s Theorem

More information

Lecture 5. Karnaugh-Map

Lecture 5. Karnaugh-Map Lecture 5 - Lecture 5 Karnaugh-Map Lecture 5-2 Karnaugh-Map Set Logic Venn Diagram K-map Lecture 5-3 K-Map for 2 Variables Lecture 5-4 K-Map for 3 Variables C C C Lecture 5-5 Logic Expression, Truth Table,

More information

EC-121 Digital Logic Design

EC-121 Digital Logic Design EC-121 Digital Logic Design Lecture 2 [Updated on 02-04-18] Boolean Algebra and Logic Gates Dr Hashim Ali Spring 2018 Department of Computer Science and Engineering HITEC University Taxila!1 Overview What

More information

Logic and Computer Design Fundamentals. Chapter 2 Combinational Logic Circuits. Part 1 Gate Circuits and Boolean Equations

Logic and Computer Design Fundamentals. Chapter 2 Combinational Logic Circuits. Part 1 Gate Circuits and Boolean Equations Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part Gate Circuits and Boolean Equations Charles Kime & Thomas Kaminski 28 Pearson Education, Inc. (Hperlinks are active in

More information

Review for Test 1 : Ch1 5

Review for Test 1 : Ch1 5 Review for Test 1 : Ch1 5 October 5, 2006 Typeset by FoilTEX Positional Numbers 527.46 10 = (5 10 2 )+(2 10 1 )+(7 10 0 )+(4 10 1 )+(6 10 2 ) 527.46 8 = (5 8 2 ) + (2 8 1 ) + (7 8 0 ) + (4 8 1 ) + (6 8

More information

Combinatorial Logic Design Principles

Combinatorial Logic Design Principles Combinatorial Logic Design Principles ECGR2181 Chapter 4 Notes Logic System Design I 4-1 Boolean algebra a.k.a. switching algebra deals with boolean values -- 0, 1 Positive-logic convention analog voltages

More information

Boolean Algebra and Digital Logic

Boolean Algebra and Digital Logic All modern digital computers are dependent on circuits that implement Boolean functions. We shall discuss two classes of such circuits: Combinational and Sequential. The difference between the two types

More information

Digital Design 2. Logic Gates and Boolean Algebra

Digital Design 2. Logic Gates and Boolean Algebra Digital Design 2. Logic Gates and oolean lgebra József Sütő ssistant Lecturer References: [1] D.M. Harris, S.L. Harris, Digital Design and Computer rchitecture, 2nd ed., Elsevier, 213. [2] T.L. Floyd,

More information

UNIT 5 KARNAUGH MAPS Spring 2011

UNIT 5 KARNAUGH MAPS Spring 2011 UNIT 5 KRNUGH MPS Spring 2 Karnaugh Maps 2 Contents Minimum forms of switching functions Two- and three-variable Four-variable Determination of minimum expressions using essential prime implicants Five-variable

More information

Learning Objectives. Boolean Algebra. In this chapter you will learn about:

Learning Objectives. Boolean Algebra. In this chapter you will learn about: Ref. Page Slide /78 Learning Objectives In this chapter you will learn about: oolean algebra Fundamental concepts and basic laws of oolean algebra oolean function and minimization Logic gates Logic circuits

More information

Chapter 2: Switching Algebra and Logic Circuits

Chapter 2: Switching Algebra and Logic Circuits Chapter 2: Switching Algebra and Logic Circuits Formal Foundation of Digital Design In 1854 George Boole published An investigation into the Laws of Thoughts Algebraic system with two values 0 and 1 Used

More information

Chapter 2 Combinational

Chapter 2 Combinational Computer Engineering 1 (ECE290) Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations HOANG Trang Reference: 2008 Pearson Education, Inc. Overview Part 1 Gate Circuits and Boolean

More information

Midterm1 Review. Jan 24 Armita

Midterm1 Review. Jan 24 Armita Midterm1 Review Jan 24 Armita Outline Boolean Algebra Axioms closure, Identity elements, complements, commutativity, distributivity theorems Associativity, Duality, De Morgan, Consensus theorem Shannon

More information

Ch 2. Combinational Logic. II - Combinational Logic Contemporary Logic Design 1

Ch 2. Combinational Logic. II - Combinational Logic Contemporary Logic Design 1 Ch 2. Combinational Logic II - Combinational Logic Contemporary Logic Design 1 Combinational logic Define The kind of digital system whose output behavior depends only on the current inputs memoryless:

More information

Logic Design Combinational Circuits. Digital Computer Design

Logic Design Combinational Circuits. Digital Computer Design Logic Design Combinational Circuits Digital Computer Design Topics Combinational Logic Karnaugh Maps Combinational uilding locks Timing 2 Logic Circuit logic circuit is composed of: Inputs Outputs Functional

More information

for Digital Systems Simplification of logic functions Tajana Simunic Rosing Sources: TSR, Katz, Boriello & Vahid

for Digital Systems Simplification of logic functions Tajana Simunic Rosing Sources: TSR, Katz, Boriello & Vahid SE140: omponents and Design Techniques for Digital Systems Simplification of logic functions Tajana Simunic Rosing 1 What we covered thus far: Number representations Where we are now inary, Octal, Hex,

More information

Chapter 2 (Lect 2) Canonical and Standard Forms. Standard Form. Other Logic Operators Logic Gates. Sum of Minterms Product of Maxterms

Chapter 2 (Lect 2) Canonical and Standard Forms. Standard Form. Other Logic Operators Logic Gates. Sum of Minterms Product of Maxterms Chapter 2 (Lect 2) Canonical and Standard Forms Sum of Minterms Product of Maxterms Standard Form Sum of products Product of sums Other Logic Operators Logic Gates Basic and Multiple Inputs Positive and

More information

Chap 2. Combinational Logic Circuits

Chap 2. Combinational Logic Circuits Overview 2 Chap 2. Combinational Logic Circuits Spring 24 Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard Forms Part 2 Circuit Optimization Two-Level Optimization

More information

Chapter 2 Boolean Algebra and Logic Gates

Chapter 2 Boolean Algebra and Logic Gates Chapter 2 Boolean Algebra and Logic Gates The most common postulates used to formulate various algebraic structures are: 1. Closure. N={1,2,3,4 }, for any a,b N we obtain a unique c N by the operation

More information

EEE130 Digital Electronics I Lecture #4

EEE130 Digital Electronics I Lecture #4 EEE130 Digital Electronics I Lecture #4 - Boolean Algebra and Logic Simplification - By Dr. Shahrel A. Suandi Topics to be discussed 4-1 Boolean Operations and Expressions 4-2 Laws and Rules of Boolean

More information

Karnaugh Maps (K-Maps)

Karnaugh Maps (K-Maps) Karnaugh Maps (K-Maps) Boolean expressions can be minimized by combining terms P + P = P K-maps minimize equations graphically Put terms to combine close to one another B C C B B C BC BC BC BC BC BC BC

More information

Binary logic consists of binary variables and logical operations. The variables are

Binary logic consists of binary variables and logical operations. The variables are 1) Define binary logic? Binary logic consists of binary variables and logical operations. The variables are designated by the alphabets such as A, B, C, x, y, z, etc., with each variable having only two

More information

E&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev

E&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev E&CE 223 Digital Circuits & Systems Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev 4 of 92 Section 2: Boolean Algebra & Logic Gates Major topics Boolean algebra NAND & NOR gates Boolean

More information

Digital Logic & Computer Design CS Professor Dan Moldovan Spring Copyright 2007 Elsevier 2-<101>

Digital Logic & Computer Design CS Professor Dan Moldovan Spring Copyright 2007 Elsevier 2-<101> Digital Logic & Computer Design CS 434 Professor Dan Moldovan Spring 2 Copyright 27 Elsevier 2- Chapter 2 :: Combinational Logic Design Digital Design and Computer Architecture David Money Harris and

More information

Logical Design of Digital Systems

Logical Design of Digital Systems Lecture 4 Table of Content 1. Combinational circuit design 2. Elementary combinatorial circuits for data transmission 3. Memory structures 4. Programmable logic devices 5. Algorithmic minimization approaches

More information