# L23 - CS61C L23 Combinational Logic Wawrzynek Fall 2007 ©...

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

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.

Unformatted text preview: CS61C L23 Combinational Logic Wawrzynek, Fall 2007 © UCB 10/19/2007 John Wawrzynek (www.cs.berkeley.edu/~johnw) www-inst.eecs.berkeley.edu/~cs61c/ CS61C – Machine Structures Lecture 23 - Representing and Designing Combinational Logic Circuits 1 CS61C L23 Combinational Logic Wawrzynek, Fall 2007 © UCB Combinational Logic (CL) circuits • Our previous adder circuit is an example. • Output is a function of the inputs only. • Similar to a pure function in mathematics, y = f(x). (No way to store information. No side effects) • If we change X, Y will change immediately (after a short delay). • Very important: This is not like a function call! F is active and doing what it does continuously. It is not “invoked” or “called”. y i = f i (x0 , . . . . , xn-1), where x, y are {0,1}. 2 CS61C L23 Combinational Logic Wawrzynek, Fall 2007 © UCB Truth Tables Uniquely Defne CL Function 3 CS61C L23 Combinational Logic Wawrzynek, Fall 2007 © UCB What do we need to know about CL?...
View Full Document

{[ snackBarMessage ]}

### Page1 / 9

L23 - CS61C L23 Combinational Logic Wawrzynek Fall 2007 ©...

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

View Full Document
Ask a homework question - tutors are online