Combinational Design ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.

Slides:

Advertisements

Similar presentations

Give qualifications of instructors: DAP

Advertisements

1 CK Cheng CSE Dept. UC San Diego CS 140, Lecture 2 Combinational Logic.

1 Homework Reading –Tokheim, Section 5-10, 7-4 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.

ECE 301 – Digital Electronics Circuit Design and Analysis (Lecture #9A) The slides included herein were taken from the materials accompanying Fundamentals.

ECE 301 – Digital Electronics Minterm and Maxterm Expansions and Incompletely Specified Functions (Lecture #6) The slides included herein were taken from.

ECE 331 – Digital System Design

1 CK Cheng CSE Dept. UC San Diego CS 140, Lecture 2 Combinational Logic.

CK Cheng Tuesday 10/2/02 CS 140 Lecture 2. Part I. Combinational Logic I) Specification –a. Language –b. Truth Table –c. Boolean Algebra –d. Incompletely.

Contemporary Logic Design Two-Level Logic © R.H. Katz Transparency No. 3-1 Chapter #2: Two-Level Combinational Logic Section 2.1, Logic Functions.

Lecture 1: Introduction to Digital Logic Design CK Cheng Tuesday 4/1/02.

Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.

ECE 331 – Digital System Design Karnaugh Maps and Determining a Minimal Cover (Lecture #7) The slides included herein were taken from the materials accompanying.

CS 105 Digital Logic Design

Chapter 2: Boolean Algebra and Logic Functions

Chapter 2 Combinational Systems And / Or / Not. TRIAD PRINCIPLE: Combinational is about And / Or / Not combinations As well as equivalent functions. It.

Combinational Logic Design

4.1 Conversion of English Sentences to Boolean Equations

1 COMBINATIONAL LOGIC One or more digital signal inputs One or more digital signal outputs Outputs are only functions of current input values (ideal) plus.

طراحی مدارهای منطقی نیمسال دوم دانشگاه آزاد اسلامی واحد پرند.

©2004 Brooks/Cole FIGURES FOR CHAPTER 4 APPLICATIONS OF BOOLEAN ALGEBRA MINTERM AND MAXTERM EXPANSIONS Click the mouse to move to the next page. Use the.

Switching functions The postulates and sets of Boolean logic are presented in generic terms without the elements of K being specified In EE we need to.

Unit IV Fundamentals of Logic Design by Roth and Kinney.

ADDERS Half Adders Recall that the basic rules of binary addition are as indicated below in Table 2-9. A circuit known as the half-adder carries out these.

Number Systems ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.

Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.

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

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

ECE 331 – Digital System Design Circuit Design and Analysis (Lecture #9A) The slides included herein were taken from the materials accompanying Fundamentals.

ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.

Unit 5 Karnaugh Maps Fundamentals of Logic Design by Roth and Kinney.

Karnaugh Maps ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.

1 Minterm and Maxterm Expressions Definition: a minterm of n variables is a product of the variables in which each appears exactly once in true or complemented.

05 BA2 Page 1 ECEn/CS 224 Boolean Algebra – Part 2.

Chap 2. Combinational Logic Circuits

CHAPTER 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs

ECE 320 Homework #3 1. Simplify the Boolean function F using the don’t care conditions d, in both S.O.P. and P.O.S. form: a) F=A’B’D’+A’CD+A’BC d=A’BC’D+ACD+AB’D’

CEC 220 Digital Circuit Design

Digital Design Module 2 Decoder Amit Kumar AP SCSE, GU Greater Noida.

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

CEC 220 Digital Circuit Design Minterms and Maxterms Monday, January 26 CEC 220 Digital Circuit Design Slide 1 of 11.

ACOE161Digital Circuit Design1 Design Of Combinational Logic Circuits.

1 EENG 2710 Chapter 3 Simplification of Switching Functions.

1 CS 352 Introduction to Logic Design Lecture 2 Ahmed Ezzat Boolean Algebra and Its Applications Ch-3 + Ch-4.

©2010 Cengage Learning SLIDES FOR CHAPTER 4 APPLICATIONS OF BOOLEAN ALGEBRA MINTERM AND MAXTERM EXPANSIONS Click the mouse to move to the next page. Use.

UNIT 4 APPLICATIONS OF BOOLEAN ALGEBRA MINTERM AND MAXTERM EXPANSIONS Click the mouse to move to the next page. Use the ESC key to exit this chapter. This.

Lecture 1 Gunjeet kaur Dronacharya group of institutions.

Truth Tables & Logic Expressions

Logic Gates and Logic Circuits

Chapter 2: Boolean Algebra and Logic Functions

Combinational Circuit Design

ECE Digital logic Lecture 10: Karnaugh MAps

CSE 140 : Components and Design Techniques for Digital Systems

Chapter 4 Combinational Logic

Boolean Algebra.

Elec 2607 Digital Switching Circuits

CSE140 HW2 Preparation Xinyuan Wang 04/20/2018.

ECE 331 – Digital System Design

ELL100: INTRODUCTION TO ELECTRICAL ENGG.

CSE 370 – Winter 2002 – Logic minimization - 1

Lecture 7 Logistics Last lecture Today HW2 due now Lab2 going on

January 19 W’05 Yutao He 4532B Boelter Hall CSM51A/EEM16-Sec.1 W’05

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

Number Systems and Circuits for Addition

Lecture 4 Minterm and Maxterm

3-Variable K-map AB/C AB/C A’B’ A’B AB AB’

XOR Function Logic Symbol  Description  Truth Table 

Lecture 7 Logistics Last lecture Today HW2 due now Lab2 going on

Truth Tables & Logic Expressions

ECE 331 – Digital System Design

Presentation transcript:

Combinational Design ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning

Combinational Circuit Design  The three main steps in designing a single- output combinational switching circuit are: Find a switching function that specifies the desired behavior of the circuit. Find a simplified algebraic expression for the function. Realize the simplified function using available logic elements. 311_042

Example 1 311_043 F A B Define a two-valued variable to indicate whether each phrase is true or false: F = 1 if “Mary watches TV” is true; otherwise F = 0. A = 1 if “it is Monday night” is true; otherwise A = 0. B = 1 if “she has finished her homework” is true; otherwise B = 0. Because F is “true” if A and B are both “true”, we can represent the sentence by F = A B

Example 2 311_044  The alarm will ring iff the alarm switch is turned on and the door is not closed, or it is after 6 P.M. and the window is not closed.

Minterms and Maxterms 311_045

Minterm Expansion 311_046 Find the minterm expansion of f(a,b,c,d) = a'(b ' + d) + acd '

Design Example  Design an adder which adds two 2-bit binary numbers to give a 3-bit binary sum. 311_047

Truth Table 311_048

Incompletely Specified Functions 311_049 don't-cares

Design Example  Design a circuit so that the output (Z) is 1 iff the decimal number represented in BCD is exactly divisible by _0410

Binary Adder Design 311_0411

311_0412 Binary Addition (Full Adder)

Binary Subtracter 311_0413

Summary  Word Problems  Truth Tables  Minterms and Maxterms  Don't Cares 311_0414