1. CS 61C L28 Representations of Combinatorial Logic Circuits (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia www.cs.berkeley.edu/~ddgarcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 28 – Representations of Combinatorial Logic Circuits 2004-04-02 Google Gmail Service!!   Search, don't sort. Use Google search to find the message you want. Don't throw anything away. 1 GB of free storage! Threaded! No pop-up ads or banners. Only relevant text ads & links to related web pages.

2. CS 61C L28 Representations of Combinatorial Logic Circuits (2) Garcia, Spring 2004 © UCB Review… We use feedback to maintain state Register files used to build memories D-FlipFlops used for Register files Clocks usually tied to D-FlipFlop load Setup and Hold times important Pipeline big-delay CL for faster clock Finite State Machines extremely useful You’ll see them again in 150, 152 & 164

3. CS 61C L28 Representations of Combinatorial Logic Circuits (3) Garcia, Spring 2004 © UCB Finite State Machine Example: 3 ones… Draw the FSM… PSInputNSOutput 000 0 1010 0000 011100 0000 101001 Truth table…

4. CS 61C L28 Representations of Combinatorial Logic Circuits (4) Garcia, Spring 2004 © UCB Hardware Implementation of FSM + =?

5. CS 61C L28 Representations of Combinatorial Logic Circuits (5) Garcia, Spring 2004 © UCB General Model for Synchronous Systems

6. CS 61C L28 Representations of Combinatorial Logic Circuits (6) Garcia, Spring 2004 © UCB Peer Instruction (last time) A. HW feedback akin to SW recursion B. We can implement a D-Q flipflop as simple CL (And, Or, Not gates) C. You can build a FSM to signal when an equal number of 0s and 1s has appeared in the input. ABC 1: FFF 2: FFT 3: FTF 4: FTT 5: TFF 6: TFT 7: TTF 8: TTT

7. CS 61C L28 Representations of Combinatorial Logic Circuits (7) Garcia, Spring 2004 © UCB Representations of CL Circuits… Truth Tables Logic Gates Boolean Algebra

8. CS 61C L28 Representations of Combinatorial Logic Circuits (8) Garcia, Spring 2004 © UCB Truth Tables 0

9. CS 61C L28 Representations of Combinatorial Logic Circuits (9) Garcia, Spring 2004 © UCB TT Example #1: 1 iff one (not both) a,b=1 aby 000 011 101 110

10. CS 61C L28 Representations of Combinatorial Logic Circuits (10) Garcia, Spring 2004 © UCB TT Example #2: 2-bit adder How Many Rows?

11. CS 61C L28 Representations of Combinatorial Logic Circuits (11) Garcia, Spring 2004 © UCB TT Example #3: 32-bit unsigned adder How Many Rows?

12. CS 61C L28 Representations of Combinatorial Logic Circuits (12) Garcia, Spring 2004 © UCB TT Example #3: 3-input majority circuit

13. CS 61C L28 Representations of Combinatorial Logic Circuits (13) Garcia, Spring 2004 © UCB Logic Gates (1/2)

14. CS 61C L28 Representations of Combinatorial Logic Circuits (14) Garcia, Spring 2004 © UCB And vs. Or review – Dan’s mnemonic AND Gate C A B SymbolDefinition AN D

15. CS 61C L28 Representations of Combinatorial Logic Circuits (15) Garcia, Spring 2004 © UCB Logic Gates (2/2)

16. CS 61C L28 Representations of Combinatorial Logic Circuits (16) Garcia, Spring 2004 © UCB 2-input gates extend to n-inputs N-input XOR is the only one which isn’t so obvious It’s simple: XOR is a 1 iff the # of 1s at its input is odd 

17. CS 61C L28 Representations of Combinatorial Logic Circuits (17) Garcia, Spring 2004 © UCB Truth Table  Gates (e.g., majority circ.)

18. CS 61C L28 Representations of Combinatorial Logic Circuits (18) Garcia, Spring 2004 © UCB Truth Table  Gates (e.g., FSM circ.) PSInputNSOutput 000 0 1010 0000 011100 0000 101001 or equivalently…

19. CS 61C L28 Representations of Combinatorial Logic Circuits (19) Garcia, Spring 2004 © UCB Boolean Algebra George Boole, 19 th Century mathematician Developed a mathematical system (algebra) involving logic, later known as “Boolean Algebra” Primitive functions: AND, OR and NOT The power of BA is there’s a one-to-one correspondence between circuits made up of AND, OR and NOT gates and equations in BA + means OR, means AND, x means NOT

20. CS 61C L28 Representations of Combinatorial Logic Circuits (20) Garcia, Spring 2004 © UCB Boolean Algebra (e.g., for majority fun.) y = a b + a c + b c

21. CS 61C L28 Representations of Combinatorial Logic Circuits (21) Garcia, Spring 2004 © UCB Boolean Algebra (e.g., for FSM) PSInputNSOutput 000 0 1010 0000 011100 0000 101001 or equivalently… y = PS 1 PS 0 INPUT

22. CS 61C L28 Representations of Combinatorial Logic Circuits (22) Garcia, Spring 2004 © UCB BA: Circuit & Algebraic Simplification BA also great for circuit verification Circ X = Circ Y? use BA to prove!

23. CS 61C L28 Representations of Combinatorial Logic Circuits (23) Garcia, Spring 2004 © UCB Laws of Boolean Algebra

24. CS 61C L28 Representations of Combinatorial Logic Circuits (24) Garcia, Spring 2004 © UCB Boolean Algebraic Simplification Example

25. CS 61C L28 Representations of Combinatorial Logic Circuits (25) Garcia, Spring 2004 © UCB Canonical forms (1/2) Sum-of-products (ORs of ANDs)

26. CS 61C L28 Representations of Combinatorial Logic Circuits (26) Garcia, Spring 2004 © UCB Canonical forms (2/2)

27. CS 61C L28 Representations of Combinatorial Logic Circuits (27) Garcia, Spring 2004 © UCB Peer Instruction A. (a+b) (a+b) = b B. N-input gates can be thought of cascaded 2-input gates. I.e., (a ∆ bc ∆ d ∆ e) = a ∆ (bc ∆ (d ∆ e)) where ∆ is one of AND, OR, XOR, NAND C. You can use a NOR with clever wiring to simulate AND, OR, & NOT ABC 1: FFF 2: FFT 3: FTF 4: FTT 5: TFF 6: TFT 7: TTF 8: TTT

28. CS 61C L28 Representations of Combinatorial Logic Circuits (28) Garcia, Spring 2004 © UCB “And In conclusion…” Use this table and techniques we learned to transform from 1 to another