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

Slides:



Advertisements
Similar presentations
Modern VLSI Design 3e: Chapter 3 Copyright 1998, 2002 Prentice Hall PTR Topics n Combinational logic functions. n Static complementary logic gate structures.
Advertisements

Switching circuits Composed of switching elements called “gates” that implement logical blocks or switching expressions Positive logic convention (active.
Logic Gates.
Static CMOS Circuits.
FPGA-Based System Design: Chapter 2 Copyright 2003 Prentice Hall PTR Gate Design n Static complementary logic gate structures. n Switch logic. n Other.
VLSI lecture, 2000 Lecture 4 MOS Circuits Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut.
Instructor Dr Sameh Abdulatif
Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania ECE VLSI Circuit Design Lecture 7 - Combinational.
Modern VLSI Design 2e: Chapter 4 Copyright  1998 Prentice Hall PTR Topics n Switch networks. n Combinational testing.
Modern VLSI Design 2e: Chapter4 Copyright  1998 Prentice Hall PTR.
Computer organization at the logic level Some not so famous last words.
Lecture #24 Gates to circuits
Modern VLSI Design 2e: Chapter 5 Copyright  1998 Prentice Hall PTR Topics n Memory elements. n Basics of sequential machines.
Topics Combinational logic functions.
Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Topics n Memories: –ROM; –SRAM; –DRAM. n PLAs.
Digital Integrated Circuits© Prentice Hall 1995 Combinational Logic COMBINATIONAL LOGIC.
W. G. Oldham EECS 40 Fall 2001 Lecture 2 Copyright Regents of University of California The CMOS Inverter: Current Flow during Switching V IN V OUT V DD.
In this module you will learn: What the various logic gates do. How to represent logic gates on a circuit diagram. The truth tables for the logic gates.
Floyd Digital Fundamentals, 9/e Copyright ©2006 by Pearson Education, Inc. Upper Saddle River, New Jersey All rights reserved. Slide 1 Digital Fundamentals.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals with PLD Programming.
Modern VLSI Design 4e: Chapter 3 Copyright  2008 Wayne Wolf Topics n Combinational logic functions. n Static complementary logic gate structures.
Complementary CMOS Logic Style Construction (cont.) Digital Integrated Circuits© Prentice Hall 1995 Introduction.
FPGA-Based System Design: Chapter 2 Copyright  2003 Prentice Hall PTR Topics n Combinational logic functions. n Static complementary logic gate structures.
Complementary CMOS Logic Style Construction (cont.)
Modern VLSI Design 2e: Chapter 3 Copyright  1998 Prentice Hall PTR Topics n Electrical properties of static combinational gates: –transfer characteristics;
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Combinational network delay. n Logic optimization.
Digital Electronics Lecture 6 Combinational Logic Circuit Design.
Modern VLSI Design 3e: Chapter 3 Copyright  1998, 2002 Prentice Hall PTR Topics n Pseudo-nMOS gates. n DCVS gates. n Domino gates.
Modern VLSI Design 3e: Chapter 3Partly from 2002 Prentice Hall PTR week5-1 Lecture 14 CMOS Logic Gates Feb. 5, 2003.
Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.
Lecture 22: 11/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
3. Logic Gate 3.1 Introduction static, fully complementary CMOS psudo-nMOS, domino logic 3.2 Combinational Logic Functions combinational logic ---- specification.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
Modern VLSI Design 3e: Chapters 3 & 8Partly from 2002 Prentice Hall PTR week6-1 Lectures 16 Transfer Characteristics (Delay and Power) Feb. 10, 2003.
Modern VLSI Design 4e: Chapter 3 Copyright  2008 Wayne Wolf Topics n Pseudo-nMOS gates. n DCVS logic. n Domino gates. n Design-for-yield. n Gates as IP.
Chapter 5 Boolean Algebra and Reduction Techniques 1.
VLSI Design Lecture 5: Logic Gates Mohammad Arjomand CE Department Sharif Univ. of Tech. Adapted with modifications from Wayne Wolf’s lecture notes.
CS 121 Digital Logic Design Gate-Level Minimization Chapter 3.
Boolean Algebra and Reduction Techniques
Logic Gates M. AL-Towaileb1. Introduction Boolean algebra is used to model the circuitry of electronic devices. Each input and each output of such a device.
Modern VLSI Design 3e: Chapter 3 Copyright  1998, 2002 Prentice Hall PTR Topics n Wire delay. n Buffer insertion. n Crosstalk. n Inductive interconnect.
Modern VLSI Design 3e: Chapter 3 Copyright  1998, 2002 Prentice Hall PTR Topics n Electrical properties of static combinational gates: –transfer characteristics;
CMOS Logic Gates. NMOS transistor acts as a switch 2 When gate voltage is 0 V No channel is formed current does not flow easily “open switch” When gate.
Chapter 3 Digital Logic Structures
CHAPTER 5 Combinational Logic Analysis
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Transistor sizing: –Spice analysis. –Logical effort.
1 ECE2030 Introduction to Computer Engineering Lecture 4: CMOS Network Prof. Hsien-Hsin Sean Lee School of ECE Georgia Institute of Technology.
Chapter 5 Boolean Algebra and Reduction Techniques 1.
Combinational Logic Analysis. Basic Combinational Logic Circuits AND-OR logic AND-OR logic AND-OR logic produces an SOP expression. AND-OR logic produces.
Computer Organization and Design Transistors & Logic - II Montek Singh Wed, Oct 17, 2012 Lecture 11.
Logic gates.
CHAPTER 7 MULTI-LEVEL GATE CIRCUITS / NAND AND NOR GATES
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
EI205 Lecture 5 Dianguang Ma Fall 2008.
Boolean Expressions Lecture No. 10.
Digital Fundamentals Floyd Chapter 5 Tenth Edition
CSE 370 – Winter Combinational Implementation - 1
Logic Gates.
COMBINATIONAL LOGIC DESIGN
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Logic Gates Dr.Halimah Alshehri.
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Combinational Logic Circuit
Presentation transcript:

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

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.

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.

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.

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.

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.

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

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

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

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

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

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

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

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.

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

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.

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