CENG 241 Digital Design 1 Lecture 2 Amirali Baniasadi

Slides:



Advertisements
Similar presentations
Chapter 3 Gate-Level Minimization
Advertisements

Boolean Algebra and Logic Gates
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
CS1104 – Computer Organization
Princess Sumaya University
Chapter 3 Basic Logic Gates 1.
Chapter 4 Gates and Circuits.
Switching circuits Composed of switching elements called “gates” that implement logical blocks or switching expressions Positive logic convention (active.
Chapter 4 Gates and Circuits.
ENGIN112 L7: More Logic Functions September 17, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 7 More Logic Functions: NAND, NOR,
Karnaugh Map Adjacent Squares
Chapter 10 Digital CMOS Logic Circuits
Chapter 3 Logic Gates and Boolean Algebra – Part 1
Chapter 3 Gate-Level Minimization
Chapter 3 Logic Gates.
Gates and Circuits Nell Dale & John Lewis (adaptation by Erin Chambers and Michael Goldwasser)
CT455: Computer Organization Logic gate
Digital Logic Design Gate-Level Minimization
Introduction to Logic Gates
L14: Boolean Logic and Basic Gates
The scale of IC design Small-scale integrated, SSI: gate number usually less than 10 in a IC. Medium-scale integrated, MSI: gate number ~10-100, can operate.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 2 – Combinational.
Digital Electronics Lecture 2 Logic Gates. Lecture 2 outline Announcement:
Boolean Algebra and Logic Gates
CS2100 Computer Organisation
Other Gate Types COE 202 Digital Logic Design Dr. Aiman El-Maleh
Exclusive-OR and Exclusive-NOR Gates
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Chapter3: Gate-Level Minimization Part 2
Digital Components Introduction Gate Characteristics Logic Families
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 3.
Karnaugh Map Adjacent Squares
©2004 Brooks/Cole FIGURES FOR CHAPTER 7 MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES Click the mouse to move to the next page. Use the ESC key to exit.
Exclusive-OR and Exclusive-NOR Gates
Boolean Algebra and Logic Gates
Chapter 4 Gates and Circuits.
Addition 1’s to 20.
Princess Sumaya University
25 seconds left…...
Week 1.
We will resume in: 25 Minutes.
KU College of Engineering Elec 204: Digital Systems Design
CENG 241 Digital Design 1 Lecture 3 Amirali Baniasadi
ECE 424 – Introduction to VLSI
CENG 241 Digital Design 1 Lecture 4
Review for Exam 1 Chapters 1 through 3.
Combinational Logic Circuits Chapter 2 Mano and Kime.
CENG 241 Digital Design 1 Lecture 1 Amirali Baniasadi
1 Homework Reading –Tokheim, Chapter 3, 4, and –Logg-o on Analytical Engine Website Machine Projects –Continue on mp3 Labs –Continue in labs.
Combinational Logic Circuits Chapter 2 Mano and Kime.
Boolean Algebra and Logic Gates CE 40 B 18 June 2003.
1 Logic Gates Digital Computer Logic Kashif Bashir WWW:
 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.
CENG 241 Digital Design 1 Lecture 5 Amirali Baniasadi
Logic and Computer Design Simon Petruc-Naum CS 147 – Dr. S.M. Lee.
ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.
Boolean Algebra and Logic Gates
Homework Reading Machine Projects Labs
LOGIC GATE TIMING DIAGRAM.
Homework Reading Machine Projects Labs
ECE 2110: Introduction to Digital Systems
Digital Logic.
Digital Signals Digital Signals have two basic states:
CSC 220: Computer Organization Logic Gates and Functions
Digital Logic Chapter-2
Digital Logic Chapter-2
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
Presentation transcript:

CENG 241 Digital Design 1 Lecture 2 Amirali Baniasadi

2 This Lecture zReview of last lecture zBoolean Algebra

3 Boolean Function: Example zTruth table zx y z F1 F2 z z z z z z z z A Boolean Function can be represented in only one truth table forms

4 Canonical & Standard Forms zConsider two binary variables x, y and the AND operation zfour combinations are possible: x.y, x’.y, x.y’, x’.y’ zeach AND term is called a minterm or standard products zfor n variables we have 2 n minterms zConsider two binary variables x, y and the OR operation zfour combinations are possible: x+y, x’+y, x+y’, x’+y’ zeach OR term is called a maxterm or standard sums zfor n variables we have 2 n maxterms

5 Minterms zx y z Terms Designation z x’.y’.z’ m0 z x’.y’.z m1 z x’.y.z’ m2 z x’.y.z m3 z x.y’.z’ m4 z x.y’.z m5 z x.y.z’ m6 z x.y.z m7

6 Maxterms zx y z Designation Terms z M0 x+y+z z M1 x+y+z’ z M2 x+y’+z z M3 x+y’+z’ z M4 x’+y+z z M5 x’+y+z’ z M6 x’+y’+z z M7 x’+y’+z’

7 Boolean Function: Exampl How to express algebraically z1.Form a minterm for each combination forming a 1 z2.OR all of those terms zTruth table example: zx y z F1 minterm z z x’.y’.z m1 z z z x.y’.z’ m4 z z z x.y.z m7 zF1=m1+m4+m7=x’.y’.z+x.y’.z’+x.y.z=Σ(1,4,7)

8 Boolean Function: Exampl How to express algebraically z1.Form a maxterm for each combination forming a 0 z2.AND all of those terms zTruth table example: zx y z F1 maxterm z x+y+z M0 z z x+y’+z M2 z x+y’+z’ M3 z z x’+y+z’ M5 z x’+y’+z M6 z zF1=M0.M2.M3.M5.M6 = л(0,2,3,5,6)

9 Implementations Three-level implementation vs. two-level implementation Two-level implementation normally preferred due to delay importance.

10 Digital Logic Gates

11  All gates -except for the inverter and buffer- can be extended to have more than two inputs zA gate can be extended to multiple inputs if the operation represented is commutative & associative zx+y=y+x z(x+y)+z=x+(y+z) Extension to Multiple Inputs

12 Extension to Multiple Inputs We define multiple input NAND and NOR as:

13 Extension to Multiple Inputs What about multiple input XOR? ODD function: 1 if the number of 1’s in the input is odd

14 Positive and Negative Logic Two values of binary signals

15 Integrated Circuits (ICs) zLevels of Integration zSSI: fewer than 10 gates on chip zMSI:10 to 1000 gates on chip zLSI: thousands of gates on chip zVLSI:Millions of gates on chip z Digital Logic Families zTTL transistor-transistor logic zECL emitter-coupled logic zMOS metal-oxide semiconductor zCMOS complementary metal-oxide semiconductor

16 Digital Logic Parameters zFan-out: maximum number of output signals zFan-in : number of inputs zPower dissipation zPropagation delay zNoise margin: maximum noise

17 CAD- Computer-Aided Design zHow do they design VLSI circuits???? zBy CAD tools zMany options for physical realization: FPGA, ASIC… zHardware Description Language (HDL): zRepresents logic design in textual format zResembles a programming language

18 Gate-Level Minimization zThe Map Method: zA simple method for minimizing Boolean functions zMap: diagram made up of squares zEach square represents a minterm

19 Two-Variable Map

20 Two-Variable Map Maps representing x.y and x+y

21 Three-Variable Map

22 Three-Variable Map-example 1

23 Summary zExtension to multiple inputs zPositive & Negative Logic zIntegrated Circuits zGate Level Minimization