Presentation is loading. Please wait.

Presentation is loading. Please wait.

Modern VLSI Design: Chapter 3 Copyright  1998 Prentice Hall PTR Topics n Combinational logic functions n Static complementary logic gate structures.

Similar presentations


Presentation on theme: "Modern VLSI Design: Chapter 3 Copyright  1998 Prentice Hall PTR Topics n Combinational logic functions n Static complementary logic gate structures."— Presentation transcript:

1 Modern VLSI Design: Chapter 3 Copyright  1998 Prentice Hall PTR Topics n Combinational logic functions n Static complementary logic gate structures

2 Modern VLSI Design: Chapter 3 Copyright  1998 Prentice Hall PTR Combinational logic expressions n Combinational logic: function value is a combination of function arguments. n A logic gate implements a particular logic function. n Both specification (logic equations) and implementation (logic gate networks) are written in Boolean logic.

3 Modern VLSI Design: Chapter 3 Copyright  1998 Prentice Hall PTR Gate design Why designing gates for logic functions is non-trivial: –may not have logic gates in the library for all logic expressions; –a logic expression may map into gates that consume a lot of area, delay, or power.

4 Modern VLSI Design: Chapter 3 Copyright  1998 Prentice Hall PTR Boolean algebra terminology n Function: f = a’b + ab’ n a is a variable; a and a?are literals. n ab’ is a term. n A function is irredundant if no literal can be removed without changing its truth value.

5 Modern VLSI Design: Chapter 3 Copyright  1998 Prentice Hall PTR Completeness n A set of functions f1, f2,... is complete iff every Boolean function can be generated by a combination of the functions. n NAND is a complete set; NOR is a complete set; {AND, OR} is not complete. n Transmission gates are not complete. n If your set of logic gates is not complete, you can’t design arbitrary logic.

6 Modern VLSI Design: Chapter 3 Copyright  1998 Prentice Hall PTR Static complementary gates n Complementary: have complementary pullup (p-type) and pulldown (n-type) networks. n Static: do not rely on stored charge. n Simple, effective, reliable; hence ubiquitous.

7 Modern VLSI Design: Chapter 3 Copyright  1998 Prentice Hall PTR Static complementary gate structure Pullup and pulldown networks: pullup network pulldown network V DD V SS out inputs

8 Modern VLSI Design: Chapter 3 Copyright  1998 Prentice Hall PTR Inverter

9 Modern VLSI Design: Chapter 3 Copyright  1998 Prentice Hall PTR

10 Modern VLSI Design: Chapter 3 Copyright  1998 Prentice Hall PTR NAND gate

11 Modern VLSI Design: Chapter 3 Copyright  1998 Prentice Hall PTR

12 Modern VLSI Design: Chapter 3 Copyright  1998 Prentice Hall PTR NOR gate

13 Modern VLSI Design: Chapter 3 Copyright  1998 Prentice Hall PTR

14 Modern VLSI Design: Chapter 3 Copyright  1998 Prentice Hall PTR AOI/OAI gates n AOI = and/or/invert; OAI = or/and/invert. n Implement larger functions. n Pullup and pulldown networks are compact: smaller area, higher speed than NAND/NOR network equivalents. n AOI312: and 3 inputs, and 1 input (dummy), and 2 inputs; or together these terms; then invert.

15 Modern VLSI Design: Chapter 3 Copyright  1998 Prentice Hall PTR AOI example out = [ab+c]’ symbolcircuit and or invert

16 Modern VLSI Design: Chapter 3 Copyright  1998 Prentice Hall PTR Pullup/pulldown network design n Pullup and pulldown networks are duals. n To design one gate, first design one network, then compute dual to get other network. n Example: design network which pulls down when output should be 0, then find dual to get pullup network.

17 Modern VLSI Design: Chapter 3 Copyright  1998 Prentice Hall PTR Dual network construction


Download ppt "Modern VLSI Design: Chapter 3 Copyright  1998 Prentice Hall PTR Topics n Combinational logic functions n Static complementary logic gate structures."

Similar presentations


Ads by Google