lec3 - CS 140 Lecture 3 Combinational Logic Professor CK...

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

View Full Document Right Arrow Icon
1 CS 140 Lecture 3 Combinational Logic Professor CK Cheng CSE Dept. UC San Diego
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 1.Specification 1.Implementation 1.K-maps Part I Combinational Logic.
Background image of page 2
3 Literals x i or x i Product Term x 2 x 1 ’x 0 Sum Term x 2 + x 1 ’ + x 0 Minterm of n variables: A product of n literals in which every variable appears exactly once. Maxterm of n variables: A sum of n literals in which every variable appears exactly once. Definitions
Background image of page 3

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

View Full DocumentRight Arrow Icon
4 Implementation Specification Schematic Diagram Net list, Switching expression Obj min cost Search in solution space (max performance) Cost: wires, gates Literals, product terms, sum terms We want to minimize # of terms, # of literals
Background image of page 4
5 Implementation (Optimization) ID A B f(A,B) minterm 0 0 0 0 1 0 1 1 A’B 2 1 0 1 AB’ 3 1 1 1 AB An example of 2-variable function f(A,B)
Background image of page 5

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

View Full DocumentRight Arrow Icon
6 Function can be represented by sum of minterms: f(A,B) = A’B+AB’+AB This is not optimal however! We want to minimize the number of literals and terms. We factor out common terms – A’B+AB’+AB= A’B+AB’+ AB+AB =(A’+ A )B+A(B’+ B )=B+A Hence, we have f(A,B) = A+B
Background image of page 6
7 K-Map: Truth Table in 2 Dimensions A = 0 A = 1 B = 0 B = 1 0 2 1 3 0 1 1 1 A’B AB’ AB f(A,B) = A + B
Background image of page 7

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

View Full DocumentRight Arrow Icon
8 ID A B f(A,B) minterm 0 0 0 0 1 0 1 1 A’B 2 1 0 0 3 1 1 1 AB Another Example f(A,B)=A’B+AB=(A’+A)B=B
Background image of page 8
9 On the K-map: A = 0 A= 1 B= 0 B = 1 0 2 1 3 0 0 1 1 A’B AB f(A,B)=B
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 01/07/2011 for the course CSE 140 taught by Professor Rosing during the Spring '06 term at UCSD.

Page1 / 28

lec3 - CS 140 Lecture 3 Combinational Logic Professor CK...

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