Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2 Dr. Costas Kyriacou and Dr. Konstantinos.

Slides:

Advertisements

Similar presentations

Advertisements

CT455: Computer Organization Logic gate

Combinational Logic Circuits Chapter 2 Mano and Kime.

1 Combinational Logic Design&Analysis. 2 Introduction We have learned all the prerequisite material: – Truth tables and Boolean expressions describe functions.

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

08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:

Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.

Gate-Level Minimization1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.

Boolean Algebra and Logic Gates1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.

Design Of Combinational Logic Circuits

Combinational Logic Circuits Chapter 2 Mano and Kime.

Binary Logic and Gates COE 202 Digital Logic Design Dr. Aiman El-Maleh

Lecture 7 Topics –Boolean Algebra 1. Logic and Bits Operation Computers represent information by bit A bit has two possible values, namely zero and one.

MSI Devices M. Mano & C. Kime: Logic and Computer Design Fundamentals (Chapter 5) Dr. Costas Kyriacou and Dr. Konstantinos Tatas ACOE161 - Digital Logic.

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

Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.

Digital Systems I EEC 180A Lecture 4 Bevan M. Baas.

Combinational Logic 1.

Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.

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

Linear Algebra. Circuits The circuits in computers and other input devices have inputs, each of which is either a 0 or 1, the output is also 0s and 1s.

CHAPTER 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs

1 Digital Logic Design Week 5&6 cont’d Revision for Quiz 2/Exam.

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

Chapter 4 Fundamentals of Computer Logic 1 Chapter 4: Fundamental of Computer Logic - IE337.

Logic Gates M. AL-Towaileb1. Introduction Boolean algebra is used to model the circuitry of electronic devices. Each input and each output of such a device.

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

Karnaugh Maps (K-Maps)

CHAPTER 5 Combinational Logic Analysis

CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.

BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.

Figure 5–5 Exclusive-OR logic diagram and symbols. Open file F05-05 to verify the operation. Thomas L. Floyd Digital Fundamentals, 9e Copyright ©2006 by.

CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. De Morgan’s Theorem De Morgan’s Theorem.

CEC 220 Digital Circuit Design SOP and POS forms Friday, Sept 11 CEC 220 Digital Circuit Design Slide 1 of 17.

Circuits, Truth Tables & Boolean Algebra. Expressions Can describe circuits in terms of Boolean expression.

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

Digital Logic Design. Truth Table  Logic Circuit 1. Start with truth table 2. When your output is a 1, figure out the combination of inputs, ANDs, and.

Lecture 1 Gunjeet kaur Dronacharya group of institutions.

Boolean Algebra and Logic Gates COE 202 Digital Logic Design Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals.

Homework Reading Machine Projects Labs

Logic Gates and Boolean Algebra

Combinational Logic Circuits

ECE 2110: Introduction to Digital Systems

ECE 3110: Introduction to Digital Systems

EI205 Lecture 5 Dianguang Ma Fall 2008.

ECE/CS 352 Digital Systems Fundamentals

Princess Sumaya University

CHAPTER 3 SETS AND BOOLEAN ALGEBRA

KS4 Electricity – Electronic systems

KS4 Electricity – Electronic systems

Jeremy R. Johnson Wed. Sept. 29, 1999

Dr. Clincy Professor of CS

Karnaugh Maps (K-Maps)

Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan

Logic Gates L Al-zaid Math110.

Week 7: Gates and Circuits: PART II

CS Chapter 3 (3A and ) Part 3 of 8

CSC 220: Computer Organization Logic Gates and Functions

KS4 Electricity – Electronic systems

ECB2212-Digital Electronics K-Map

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

Unit 3 Simplification and K-map

Logic Gates Dr.Halimah Alshehri.

Digital Logic Design Basics Combinational Circuits Sequential Circuits.

Principles & Applications

SYEN 3330 Digital Systems Chapter 2 – Part 1 SYEN 3330 Digital Systems.

Presentation transcript:

Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2 Dr. Costas Kyriacou and Dr. Konstantinos Tatas

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 2 Basic Logic Gates Truth Table Logic Expression Gate Symbol Logic Function

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 3 Basic Logic Gates with Inverted Outputs

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 4 Logic Gates with more than two inputs

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 5 Circuit Implementation of a Logic Expression with Gates

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 6 Circuit Implementation of Logic Expressions:- Examples

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 7 Circuit Implementation of Logic Expressions:- Homework

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 8 Truth Tables Truth table of a logic circuit is a table showing all the possible input combinations with the corresponding value of the output. Examples:

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 9 Truth Tables: Examples

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 10 Minterms and maxterms RowXYZFMintermMaxterm 0000F(0,0,0)X΄Y΄Z΄X΄Y΄Z΄Χ+Υ+Ζ 1001F(0,0,1)X΄Y΄ZX΄Y΄ZΧ+Υ+Ζ΄ 2010F(0,1,0)X΄YZ΄Χ+Υ΄+Ζ 3011F(0,1,1)X΄YZΧ+Υ΄+Ζ΄ 4100F(1,0,0)XY΄Z΄Χ΄+Υ+Ζ 5101F(1,0,1)XY΄ZΧ΄+Υ+Ζ΄ 6110F(1,1,0)XYZ΄Χ΄+Υ΄+Ζ 7111F(1,1,1)XYZΧ΄+Υ΄+Ζ΄

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 11 Standard forms: Sum of Products

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 12 Logic expression and truth table of a logic circuit

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 13 Example: Find the logic expression and fill up the truth table for the circuit below.

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 14 Homework: Find the logic expression and fill up the truth table for the circuit below.

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 15 Analyzing a logic circuit using timing diagrams Logic 0 Logic 1

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 16 Homework: Fill up the truth table and timing diagram for the circuit below.

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 17 Boolean Algebra Basic Boolean identities:

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 18 Boolean Algebra (Examples) Prove the following identities using Boolean algebra and truth tables:

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 19 Digital circuit simplification using Boolean algebra Logic functions are simplified in order to reduce the number of gates required to implement them. Thus the circuit will –cost less, –need less space and power, –be build faster with less effort. For example the expression F needs six gates to be build. If the expression is simplified then the function can be implemented with only two gates.

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 20 Boolean Algebra (Examples) Simplify the expressions given below. Use truth tables to verify your results.

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 21 Boolean Algebra (Examples - Cont.) Simplify the expressions given below. Use truth tables to verify your results.

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 22 Boolean Algebra (Examples - Cont.) Simplify the expression given below. Use truth tables to verify your results.

ACOE161ACOE161 - Digital Logic for Computers - Frederick University 23 Boolean Algebra (Examples - Cont.) Simplify the expression given below. Use truth tables to verify your results.