CS 320 Unit 3 Review of Digital Logic

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

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

CS 320 Computer Architecture Spring 2008 Unit 3 Digital Logic Review Furman Haddix, Ph.D. Assistant Professor Minnesota State University, Mankato

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

View Full Document
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
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)

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

View Full Document
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
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

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

View Full Document
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
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

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

View Full Document
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
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

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern