CS 320 Unit 3 Review of Digital Logic

CS 320 Unit 3 Review of Digital Logic - CS 320 Computer...

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 320 Computer Architecture Spring 2008 Unit 3 Digital Logic Review Furman Haddix, Ph.D. Assistant Professor Minnesota State University, Mankato
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Unit 3 Review of Digital Logic Objectives Basic Principles of Computer Component Operation Basic Boolean Operators and Truth Tables Six Gates: NOT, AND, OR, NAND, NOR, XOR Four Boolean Operators: , +, , ( ) Truth Tables Boolean Function Definitions Implementing Boolean Functions as Combinational Circuits Boolean Algebra Tanenbaum, Chapter 3
Background image of page 2
Basic Boolean Operators Boolean and Logical Operators Similar to HLL Logical Operators However, these are bit-wise Three Basic Operators NOT – Inversion changes bit value If true(1), then false(0) If false(0), then true(1) AND If all are true (1), then true(1), else false (0) OR If any are true(1), then true(1), else false(0)
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Basic Boolean Operators and Truth Tables NOT Input A Output F 0 1 1 0 AND A B F 0 0 0 0 1 0 1 0 0 1 1 1 OR A B F 0 0 0 0 1 1 1 0 1 1 1 1
Background image of page 4
More Boolean Operators XOR –OR – If odd number of inputs are true(1), true(1), else false(0) EQUALS – If even number of inputs are true(1), true(1), else false(0) NAND – Not AND – Inverted Output AND NOR – Not OR – Inverted Output OR eXclusive
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
More Truth Tables NAND A B F 0 0 1 0 1 1 1 0 1 1 1 0 XOR A B F 0 0 0 0 1 1 1 0 1 1 1 0 NOR A B F 0 0 1 0 1 0 1 0 0 1 1 0 EQUALS A B F 0 0 1 0 1 0 1 0 0 1 1 1 AND A B C F 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 OR A B C F 0 0 0 0 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 1
Background image of page 6
Basic Gates essential to understanding memory Basic Gates and Costs Not, Inverter – 1 Transistor (2-input) Nand, Nor – 2 Transistors NOT, NAND, and NOR Gates Power Ground Input Output
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Five Basic Gates AND Gate is constructed as a NOT-NAND Cost (with 2 inputs) is 3 Transistors OR Gate is constructed as a NOT-NOR Cost (with 2 inputs) is 3 Transistors
Background image of page 8
Cost of Gates with Inputs 2 Cost of NAND, NOR Number of Transistors = Number of Inputs Cost of AND, OR Number of Transistors = Number of Inputs + 1 Cost of XOR A B + A B = ((A B) (A B)) = NAND(NAND(A, NOT B),NAND(B, NOT A)) NAND (NAND(A, NOT B),NAND(B, NOT A)) NAND( NAND
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 10
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 06/09/2008 for the course CS 320 taught by Professor Furmanhaddix during the Spring '08 term at Minnesota State University, Mankato.

Page1 / 33

CS 320 Unit 3 Review of Digital Logic - CS 320 Computer...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online