Ch 4. Combinational Logic Design Principles Combinational Logic Circuit –Outputs depend only on its current inputs –No feedback loop Sequential Logic Circuit.

Slides:



Advertisements
Similar presentations
Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR
Advertisements

Sistemas Digitais I LESI - 2º ano Lesson 3 - Boolean Algebra U NIVERSIDADE DO M INHO E SCOLA DE E NGENHARIA Prof. João Miguel Fernandes
Types of Logic Circuits
CSIS 3510 Computer Organization and Architecture Topics covered in this lecture: –Review of De’Morgan’s Theorem –Using De’Morgan’s Theorem –Building a.
Logical Systems Synthesis.
ECE 2110: Introduction to Digital Systems Combinational Logic Design Principles.
Chapter 2 Logic Circuits.
ECE 3110: Introduction to Digital Systems
Computer Logic and Digital Design Chapter 2 Henry Hexmoor AND logic
EECC341 - Shaaban #1 Lec # 5 Winter Switching Algebra: Principle of Duality Any theorem or identity in switching algebra remains true if.
Physical States for Bits. Black Box Representations.
Example: Given a 4-bit input combination N=N 3 N 2 N 1 N 0, this function produces a 1 output for N=1,2,3,5,7,11,13, and 0 otherwise.  According to the.
1 COMP541 Combinational Logic - II Montek Singh Aug 27, 2014.
1 EECC341 - Shaaban #1 Lec # 6 Winter Combinational Circuit Analysis Example Given this logic circuit we can : Find corresponding logic.
2.7 NAND and NOR logic networks
Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.
Lecture 17: Digital Design Today’s topic –Intro to Boolean functions Reminders –HW 4 due Wednesday 10/8/2014 (extended) –HW 5 due Wednesday 10/15/2014.
Computer Organization 1 Logic Gates and Adders. Propositions –Venn Diagrams.
Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.
Course contents Chapter 1 - section 1.6 Chapter 2 - all sections Chapter – 4.7, and 4.12 Chapter , Chapter 6 - all sections.
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.
Lecture 22: 11/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Chapter 3: Digital Logic Dr Mohamed Menacer Taibah University
Gates and Logic Dr John Cowell phones off (please)
Unit 8 Combinational Circuit Design and Simulation Using Gates Fundamentals of Logic Design by Roth and Kinney.
Using De’Morgan’s On of the most useful principles in boolean algebra is De’Morgan’s Theorem, which allows one to switch between ANDs and NORs and ORs.
Figure 2.6. A truth table for the AND and OR operations. 2.3 Truth Tables 1.
CHAPTER 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs
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 
ECE 3110: Introduction to Digital Systems Chapter #4 Review.
Digital Design: Principles and Practices Chapter 4 Combinational Logic Design Principles.
CEC 220 Digital Circuit Design Boolean Algebra Friday, January 17 CEC 220 Digital Circuit Design Slide 1 of 22.
Chapter 4 Fundamentals of Computer Logic 1 Chapter 4: Fundamental of Computer Logic - IE337.
1/16/ CSEE, UQ Lecture 3 Hardware Description Methods, Review of Switching Algebra.
ENGG 340 Midterm Review. Introduced the Concept of Variables and Functions Introduced the Concept of AND, OR, and NOT Introduced the Concept of Truth.
CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.
CEC 220 Digital Circuit Design Boolean Algebra II Fri, Sept 4 CEC 220 Digital Circuit Design Slide 1 of 13.
ECE 2110: Introduction to Digital Systems
CEC 220 Digital Circuit Design SOP and POS forms Friday, Sept 11 CEC 220 Digital Circuit Design Slide 1 of 17.
Chapter 5 Boolean Algebra and Reduction Techniques 1.
CSE 461. Binary Logic Binary logic consists of binary variables and logical operations. Variables are designated by letters such as A, B, C, x, y, z etc.
Chapter 12. Chapter Summary Boolean Functions Representing Boolean Functions Logic Gates Minimization of Circuits (not currently included in overheads)
De Morgan’s Theorem,.
Chapter 4. Combinational Logic Design Principles
Digital Technology.
COMP541 Combinational Logic - II
14:332:231 DIGITAL LOGIC DESIGN Boolean Algebra
ECE 2110: Introduction to Digital Systems
Logic Gates and Boolean Algebra
ECE 3110: Introduction to Digital Systems
Logic Gates.
CHAPTER 3 SETS AND BOOLEAN ALGEBRA
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Jeremy R. Johnson Wed. Sept. 29, 1999
ECE 331 – Digital System Design
Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan
Boolean Algebra.
Boolean Algebra & Logic Circuits
Agenda – 2/12/18 Questions? Readings: CSI 4, P
Logic Gates.
Boolean Algebra.
Logic Gates.
Chapter 2 Introduction to Logic Circuits
KS4 Electricity – Electronic systems
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
Logic Gates.
Chapter 4 Gates and Circuits.
Digital Logic Experiment
COMP541 Combinational Logic - II
Presentation transcript:

Ch 4. Combinational Logic Design Principles Combinational Logic Circuit –Outputs depend only on its current inputs –No feedback loop Sequential Logic Circuit –Outputs depend on its current inputs and present states –Feedback loop

4.1 Switching Algebra

‘+’ : ‘OR’

& are obvious (by perfect induction) is identical to the distributive law for integers and reals Switching-algebra theorems

NAND DeMorgan’s Th.

NOR DeMorgan’s Th.

Black box Representation with Truth table Active Low

Black box Representation with Truth table

Duality PositiveNegative

Function with 3 input X, Y, Z

DeMorgan’s Th.

4.2 Combinational-Circuit Analysis

F(X, Y, Z)

Three-level without considering inverter

“Add-out” to obtain a product of sums by T8’ Sum of products Product of sums (Figure 4-12) (Figure 4-13) Same

4.3 Combinational-Circuit Synthesis Prime number detector

NAND NOR

4.4 Timing Hazards Unwanted Output Static-1 Hazard : Momentary output ‘0’ to occur during a transition in the differing input variable Static-0 Hazard : Momentary output ‘1’ to occur during a transition in the differing input variable

Unwanted Output