1 / 8

Lecture 1: Introduction to Digital Logic Design

Lecture 1: Introduction to Digital Logic Design. CK Cheng Thursday 9/26/02. We will cover four major things in this course: - Combinational Logic - Sequential Networks - Standard Modules - System Design. Overall Picture of CS140. input. Memory. conditions. Pointer. Mux. Control

nixont
Télécharger la présentation

Lecture 1: Introduction to Digital Logic Design

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture 1: Introduction toDigital Logic Design CK Cheng Thursday 9/26/02

  2. We will cover four major things in this course:- Combinational Logic- Sequential Networks- Standard Modules- System Design

  3. Overall Picture of CS140 input Memory conditions Pointer Mux Control Subsystem ALU control Memory conditions

  4. Two Types of Circuits x1 . . . xn xi fi(x) CLK Combinational logic: Sequential Networks 1) Memory 2) Time Steps (Clock) yi = fi(x1,..xn) yit = fi (x1t,…xnt, s1t, … snt) Sit+1 = gi(x1t,…,xnt, s1t,….snt)

  5. Part I. Combinational Logic ab a b ab + cd e (ab+cd) c d cd e • I) Specification • II) Implementation • III) Different Types of Gates

  6. Review of Boolean algebra and switching functions AND, OR, NOT AND OR NOT A B C 0 0 0 0 1 0 1 0 0 1 1 1 A B C 0 0 0 0 1 1 1 0 1 1 1 1 A C 0 1 1 0 A 1 A 1 A 1 A 0 A 0 A 0 1 dominates in OR 0 dominates in AND

  7. 1. Identity A * 1 = A A + 1 = 1 A * 0 = 0 A + 0 = 0 2. Complement A + A’ = 1 A * A’ = 0 3. Distributive Law A(B+C) = AB + AC A+BC = (A+B)(A+C) A B A B C A C A B A B C A C

  8. 5. Associative (A+B) + C = A + (B+C) (AB)C = A(BC) C A A B B C C A A B B C 6. Demorgan’s Law (A+B)’ = A’B’ (AB)’ = A’ + B’ 7. AC + AB + BC’ = AC + BC’

More Related