MIT6_004s09_lec04

MIT6_004s09_lec04 - MIT OpenCourseWare http:/ocw.mit.edu...

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

View Full Document Right Arrow Icon
MIT OpenCourseWare http://ocw.mit.edu For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms . 6.004 Computation Structures Spring 2009
Background image of page 1

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

View Full DocumentRight Arrow Icon
L04 - Logic Synthesis 1 6.004 – Spring 2009 2/12/09 Synthesis of Combinational Logic Lab 1 is due Thursday 2/19 Quiz 1 is a week from Friday (in section) A B modified 2/12/09 10:01 L04 - Logic Synthesis 2 6.004 – Spring 2009 2/12/09 Functional Specifications There are many ways of specifying the function of a combinational device, for example: A B Y If C is 1 then copy B to Y, otherwise copy A to Y C Concise alternatives: truth tables are a concise description of the combinational system’s function. Boolean expressions form an algebra in whose operations are AND (multiplication), OR (addition), and inversion (overbar). Any combinational (Boolean) function can be specified as a truth table or an equivalent sum-of-products Boolean expression! Argh… I’m tired of word games CBAY 0000 0011 0100 0111 1000 1010 1101 1111 Truth Table CBA A CB BA C A B C Y + + + = L04 - Logic Synthesis 3 6.004 – Spring 2009 2/12/09 Here’s a Design Approach 1) Write out our functional spec as a truth table 2) Write down a Boolean expression with terms covering each ‘1’ in the output: 3) Wire up the gates, call it a day, and declare success! This approach will always give us Boolean expressions in a particular form: SUM-OF-PRODUCTS Truth Table -it’s systematic! -it works! -it’s easy! -are we done yet??? CBA A CB BA C A B C Y + + + = L04 - Logic Synthesis 4 6.004 – Spring 2009 2/12/09 Straightforward Synthesis We can implement SUM-OF-PRODUCTS with just three levels of logic. INVERTERS/AND/OR Propagation delay -- No more than 3 gate delays (assuming gates with an arbitrary number of inputs) A B C A B C A B C A B C Y
Background image of page 2
L04 - Logic Synthesis 5 6.004 – Spring 2009 2/12/09 Basic Gate Repertoire Are we sure we have all the gates we need? Just how many two-input gates are there? AB Y 00 0 01 0 10 0 11 1 AND AB Y 00 0 01 1 10 1 11 1 OR AB Y 00 1 01 1 10 1 11 0 NAND AB Y 00 1 01 0 10 0 11 0 NOR 2 = 2 4 = 16 2 2 Hmmmm… all of these have 2-inputs (no surprise) … each with 4 combinations, giving 2 2 output cases How many ways are there of assigning 4 outputs? ________________ L04 - Logic Synthesis 6 6.004 – Spring 2009 2/12/09 There are only so many gates There are only 16 possible 2-input gates … some we know already, others are just silly I N P U T AB Z E R O A N D A > BA B > AB X O R O R N O R X N O R N O T ‘B’ A <= B N O T ‘A’ B <= A N A N D O N E 0 000000000111 11111 0 100001111000 01111 1 000110011001 10011 1 101010101010 10101 How many of these gates can be implemented using a single CMOS gate?
Background image of page 3

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

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

This note was uploaded on 11/07/2011 for the course COMPUTER S 6.004 taught by Professor Staff during the Spring '09 term at MIT.

Page1 / 8

MIT6_004s09_lec04 - MIT OpenCourseWare http:/ocw.mit.edu...

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

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