1 Homework Reading –Tokheim, Chapter 3, 4, and 6.1 - 6.3 –Logg-o on Analytical Engine Website Machine Projects –Continue on mp3 Labs –Continue in labs.

Slides:



Advertisements
Similar presentations
Boolean Algebra and Logic Gates
Advertisements

CT455: Computer Organization Logic gate
Boolean Algebra and Logic Gates
Give qualifications of instructors: DAP
Princess Sumaya University
Introduction to Logic Circuits
Logical Design.
Combinational Logic Circuits Chapter 2 Mano and Kime.
Chapter 2 Logic Circuits.
Boolean rules for simplification Dr. Ahmed Telba.
Boolean Algebra and Combinational Logic
1 Homework Reading –Tokheim, Section 5-10, 7-4 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.
EECC341 - Shaaban #1 Lec # 1 Winter Introduction to Digital Systems Analog devices and systems process time-varying signals that can take.
Digital Electronics Dan Simon Cleveland State University ESC 120 Revised December 30, 2010.
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.
1 COMP541 Combinational Logic Montek Singh Jan 16, 2007.
COMBINATIONAL LOGIC CIRCUITS C.L. x1 x2 xn Z Z = F (x1, x2, ……., Xn) F is a Binary Logic (BOOLEAN ) Function Knowing F Allows Straight Forward Direct Implementation.
9/19/06 Hofstra University – Overview of Computer Science, CSC005 1 Chapter 4 Gates and Circuits.
Contemporary Logic Design Two-Level Logic © R.H. Katz Transparency No. 3-1 Chapter #2: Two-Level Combinational Logic Section 2.1, Logic Functions.
1 Boolean Algebra & Logic Design. 2 Developed by George Boole in the 1850s Mathematical theory of logic. Shannon was the first to use Boolean Algebra.
Boolean Algebra and Logic Gates1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
TDC 311 Digital Logic. Truth Tables  AND  OR  NOT  NAND  NOR  XOR  XNOR.
Chapter 2: Boolean Algebra and Logic Functions
Chapter 4 Gates and Circuits.
Boolean Algebra and Logic Gates CE 40 B 18 June 2003.
Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.
1 Logic Gates Digital Computer Logic Kashif Bashir WWW:
Combinational Logic 1.
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /05/2013 Lecture 4: Basics of Logic Design Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER.
ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.
CHAPTER-2 Fundamentals of Digital Logic. Digital Logic Digital electronic circuits are used to build computer hardware as well as other products (digital.
1 Lect # 2 Boolean Algebra and Logic Gates Boolean algebra defines rules for manipulating symbolic binary logic expressions. –a symbolic binary logic expression.
Boolean Algebra and Logic Gates CSE-1108 Ahsanullah University of Science and Technology (AUST)
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.
Standard & Canonical Forms COE 202 Digital Logic Design Dr. Aiman El-Maleh College of Computer Sciences and Engineering King Fahd University of Petroleum.
ECE DIGITAL LOGIC LECTURE 6: BOOLEAN ALGEBRA Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2016, 02/01/2016.
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
Logic Design (CE1111 ) Lecture 2 (Chapter 2) Prepared by Dr. Lamiaa Elshenawy 1.
Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 
CHAPTER 13 Digital Logic Circuits. Figure Voltage analog of internal combustion engine in-cylinder pressure Figure 13.1.
Computer Architecture & Operations I
Computer Architecture & Operations I
Homework Reading Machine Projects Labs
Chapter 5 Combinational Logic 组合逻辑
Digital Logic.
Dr.Ahmed Bayoumi Dr.Shady Elmashad
Homework Reading Machine Projects Labs
Morgan Kaufmann Publishers
Computer Science 210 Computer Organization
Combinational Logic Circuits
Chapter 2: Boolean Algebra and Logic Functions
Digital Technology.
Homework Reading Machine Projects Labs
Logic Gates and Boolean Algebra
CS 105 Digital Logic Design
Logic Gates.
EI205 Lecture 5 Dianguang Ma Fall 2008.
Overview Part 1 – Gate Circuits and Boolean Equations
Boolean Algebra and Combinational Logic
Princess Sumaya University
CHAPTER 3 SETS AND BOOLEAN ALGEBRA
Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也
CSE 311 Foundations of Computing I
Boolean Algebra.
Logic Gates.
Logic Gates.
Chapter 2 Gates.
XOR, XNOR, and Binary Adders
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Presentation transcript:

1 Homework Reading –Tokheim, Chapter 3, 4, and –Logg-o on Analytical Engine Website Machine Projects –Continue on mp3 Labs –Continue in labs with your assigned section

2 Digital Logic Two types of digital logic design –Combinational Logic – has no memory elements –Sequential Logic – contains memory elements Combinational logic design is sometimes called Boolean algebra after George Boole –Based on binary logic –Uses AND, OR, XOR, NOT, etc. –Develop truth tables and implement a design

3 Boolean Algebra Variables / Expressions Two Values Only (0 or 1) Basic Operators AND* OR+ XOR+ NOTBar over the variable or expression Or # after variable name

4 Boolean Algebra Precedence of Operators NOT(like unary minus) AND(like multiply) DivisionNone OR/XOR(like add) SubtractionNone Parentheses to force precedence A * (B + C) is not the same as A * B + C

5 Boolean Algebra Multiplicative Identities A * 0 = 0 A * A = A(Note: Not A squared) A * A = 0 Additive Identities A + 1 = 1 A + A = A(Note: Not 2A) A + A = 1

6 Boolean Algebra Negative Identity A = A Commutative Property A * B = B * A A + B = B + A Distributive Property A (B + C) = A * B + A * C

7 Boolean Algebra Common Reductions of Sums of Products (Also called a “Minterm” expression) A * B + A * B + A * B = A + BOR A * B + A * B = A + BXOR Common Reductions of Products of Sums (Also called a “Maxterm” expression) (A + B) * (A + B) * (A + B) = A * BAND

8 For a two input, one output gate, how many possibilities are there? Assume a basic understanding of AND, OR, NOT, XOR and the negated forms: NAND and NOR Basic Logic Gates xyz ? xyxy z

9 Binary Logic Symbols/Tables AND NOT NAND

10 Binary Logic Symbols/Tables XOR OR NOR

11 Boolean Algebra / Logic Diagram Sample Boolean Equation Y = (A + B) * (C + D) Equivalent Logic Diagram Y A B C D

12 Logg-O “Design Tool”

13 Basic Logic Gates Can look at pulse trains over time as inputs rather than just constant inputs ???

14 Timing Considerations Things don’t happen instantaneously –Each signal arrives at some unique time –Gate logic takes some time to react –Changes in the output appear some time after changes to the inputs (at nanosecond level) Example, an AND gate A B Y Y A B

15 Timing Considerations Things don’t happen instantaneously –As clock speed increases, the “skew” due to differential delays narrows output pulses –Beyond the designed maximum clock speed, the circuit may fail Example, an AND gate A B Y Y A B

16 Practical Logic Implementation Transistor-Transistor-Logic (TTL) Chips –Small Scale Integration (SSI) < 12 gates/chip –Medium Scale Integration (MSI) gates/chip 7400 series – Low Power Schottky (LS) –A good compromise between speed and power Chips are generally 14- (or 16-pin) package –V cc (+5 volts) usually on pin 14 (or pin 16) –Ground (0 volts) usually on pin 7 (or 8) –BUT NOT ALWAYS TRUE

17 Practical Logic Implementation Logic Levels mapped to voltages in 2 ways: Normal Logic Signal (name w/o a bar or #) – Logic 0 is < 0.8 volt – Logic 1 is > 2.0 volt Inverted Logic Signal (name with a bar or #) – Logic 0 is > 2.0 volt – Logic 1 is < 0.8 volt