Unit II Fundamentals of Logic Design By Roth and Kinney.

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

Programmable Logic Controllers.
CSIS 3510 Computer Organization and Architecture Topics covered in this lecture: –Review of De’Morgan’s Theorem –Using De’Morgan’s Theorem –Building a.
EXPLAIN THE LOGIC OPERATION APPLYING BASIC DIGITAL ENGINEERING By Sri Wahyuni, S.Pd.
P449. p450 Figure 15-1 p451 Figure 15-2 p453 Figure 15-2a p453.
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.
ECE 331 – Digital System Design Boolean Algebra (Lecture #3) The slides included herein were taken from the materials accompanying Fundamentals of Logic.
Boolean Algebra Module M4.1 Section 5.1. Boolean Algebra and Logic Equations Switching Algebra Theorems Venn Diagrams.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
Gates CS105. Electrical Signals Transmission of data Any electrical signal has a level of voltage – Interpretation of 1s and 0s Generally speaking: –
ENGIN112 L12: Circuit Analysis Procedure September 29, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 12 Circuit Analysis Procedure.
Figure Figure 18-1 part 1 Figure 18-1 part 2.
ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives
In this module you will learn: What the various logic gates do. How to represent logic gates on a circuit diagram. The truth tables for the logic gates.
LOGIC GATES Logic generally has only 2 states, ON or OFF, represented by 1 or 0. Logic gates react to inputs in certain ways. Symbol for AND gate INPUT.
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
Unit IV Fundamentals of Logic Design by Roth and Kinney.
©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.
 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.
Unit 11 Latches and Flip-Flops Fundamentals of Logic Design By Roth and Kinney.
Unit 7 Multi-Level Gate Circuits Nand and Nor Gates Fundamentals of Logic Design Roth and Kinny.
Unit 8 Combinational Circuit Design and Simulation Using Gates Fundamentals of Logic Design by Roth and Kinney.
Circuit Simplification Truth Table  Minimized Logic Gates.
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.
Figure 4–1 Application of commutative law of addition. Thomas L. Floyd Digital Fundamentals, 9e Copyright ©2006 by Pearson Education, Inc. Upper Saddle.
Abdullah Said Alkalbani University of Buraimi
Figure 2.6. A truth table for the AND and OR operations. 2.3 Truth Tables 1.
Logic Circuits Lecture 3 By Amr Al-Awamry. Basic Definitions Binary Operators  AND z = x y = x yz=1 if x=1 AND y=1  OR z = x + y z=1 if x=1 OR y=1 
CEC 220 Digital Circuit Design Boolean Algebra I Wed, Sept 2 CEC 220 Digital Circuit Design Slide 1 of 13.
Chapter 4 Fundamentals of Computer Logic 1 Chapter 4: Fundamental of Computer Logic - IE337.
Circuits & Boolean Expressions. A ABC BC ABC C B A Example # 1: Boolean Expression: Develop a Boolean expression from a circuit.
Digital Design Module 2 Decoder Amit Kumar AP SCSE, GU Greater Noida.
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.
AND Gate Inputs Output Input A (Switch) Input B (Switch) Output Y (Lamp) 0 (Open) 0 (OFF) A B Lamp.
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.
Logic Gates, Boolean Algebra and Karnaugh Maps. Challenge! By the end of todays session can you complete the following?
COMPUTER ORGANISATION.. LAB. تنظيم الحاسبات.. عملي
ECE 301 – Digital Electronics
Table 2.1 Postulates and Theorems of Boolean Algebra
Eng. Mai Z. Alyazji October, 2016
Logic Gates and Boolean Algebra
Logic Gates Practical Objective: to develop an understanding of logic circuits and truth tables.
Combinational Logic Circuits
Questions Describe the following gates
ECE 2110: Introduction to Digital Systems
Unit 2 Boolean Algebra.
Logic Gates and Boolean Algebra
Logic Gates, Boolean Algebra and Karnaugh Maps
Lab02 :Logic Gate Fundamentals:
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
CHAPTER 2 Boolean Algebra This chapter in the book includes:
FIGURES FOR CHAPTER 2 BOOLEAN ALGEBRA
Algebra 1 Section 1.7 Identify functions and their parts
Elec 2607 Digital Switching Circuits
Schematics 201 Lecture Topic: Electrical Symbols
Digital Logic & Design Lecture 05
Example Question: Consider the expressions: (a) F = XY + XY'
ECE 301 – Digital Electronics
Instructor: Alexander Stoytchev
Logic Gates.
GCSE Computer Science – Logic Gates & Boolean Expressions
Table 2.1 Postulates and Theorems of Boolean Algebra
Binary Logic.
Instructor: Alexander Stoytchev
XOR Function Logic Symbol  Description  Truth Table 
Department of Electronics
Eng. Ahmed M Bader El-Din October, 2018
Presentation transcript:

Unit II Fundamentals of Logic Design By Roth and Kinney

2.2 Basic Operations AND, OR, NOT(complement) Switch can be used to illustrate concept. –Open switch is a 0. –Closed switch is a 1. –Picture of gate representations and truth table descriptions are illustrated on page 38 and 39.

Boolean Expressions and Truth Tables Expressions are illustrated by 2-1 and 2-2, page 39 and the resulting gate diagrams are at the top of page 40 in Figure 2-1. Figure 2-2 and Table 2.1 illustrate Truth Tables. (two input an three input tables)

2.4 Basic Theorems X+ 0 = X X+ 1 = 1 Duality equations are : –X and 1 = X –X and 0 = 0