10.3 CMOS Logic Gate Circuits

Similar documents
Chapter 10 Advanced CMOS Circuits

ECE124 Digital Circuits and Systems Page 1

Elementary Logic Gates

Gates & Boolean Algebra. Boolean Operators. Combinational Logic. Introduction

1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.

NEW adder cells are useful for designing larger circuits despite increase in transistor count by four per cell.

Module 4 : Propagation Delays in MOS Lecture 22 : Logical Effort Calculation of few Basic Logic Circuits

Notes about Small Signal Model. for EE 40 Intro to Microelectronic Circuits

Here we introduced (1) basic circuit for logic and (2)recent nano-devices, and presented (3) some practical issues on nano-devices.

Basic Logic Gates Richard E. Haskell

NAND and NOR Implementation

Lecture 5: Gate Logic Logic Optimization

BOOLEAN ALGEBRA & LOGIC GATES

Gates, Circuits, and Boolean Algebra

Field-Effect (FET) transistors

Pass Gate Logic An alternative to implementing complex logic is to realize it using a logic network of pass transistors (switches).

Understanding Logic Design

United States Naval Academy Electrical and Computer Engineering Department. EC262 Exam 1

6. BOOLEAN LOGIC DESIGN

Mixed Logic A B A B. 1. Ignore all bubbles on logic gates and inverters. This means

Digital Logic Elements, Clock, and Memory Elements

Digital circuits make up all computers and computer systems. The operation of digital circuits is based on

Optimization and Comparison of 4-Stage Inverter, 2-i/p NAND Gate, 2-i/p NOR Gate Driving Standard Load By Using Logical Effort

FORDHAM UNIVERSITY CISC Dept. of Computer and Info. Science Spring, Lab 2. The Full-Adder

[ 4 ] Logic Symbols and Truth Table

Binary Adders: Half Adders and Full Adders

Sum-of-Products and Product-of-Sums expressions

COMBINATIONAL and SEQUENTIAL LOGIC CIRCUITS Hardware implementation and software design

Small Signal Analysis of a PMOS transistor Consider the following PMOS transistor to be in saturation. Then, 1 2

10 BIT s Current Mode Pipelined ADC

The Flyback Converter

ENGI 241 Experiment 5 Basic Logic Gates

MOS Transistors as Switches

Biasing in MOSFET Amplifiers

3.Basic Gate Combinations

The MOSFET Transistor

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

Click on the links below to jump directly to the relevant section

CMOS Binary Full Adder

Karnaugh Maps & Combinational Logic Design. ECE 152A Winter 2012

An Introduction to the EKV Model and a Comparison of EKV to BSIM

Application Note AN-940

ADS9850 Signal Generator Module

LAB 7 MOSFET CHARACTERISTICS AND APPLICATIONS

So far we have investigated combinational logic for which the output of the logic devices/circuits depends only on the present state of the inputs.

A Novel Low Power, High Speed 14 Transistor CMOS Full Adder Cell with 50% Improvement in Threshold Loss Problem

3 The TTL NAND Gate. Fig. 3.1 Multiple Input Emitter Structure of TTL

Karnaugh Maps (K-map) Alternate representation of a truth table

ASYNCHRONOUS COUNTERS

Efficient Interconnect Design with Novel Repeater Insertion for Low Power Applications

CO2005: Electronics I (FET) Electronics I, Neamen 3th Ed. 1

ANALOG & DIGITAL ELECTRONICS

CHAPTER 3 Boolean Algebra and Digital Logic

Sample Problems. Practice Problems

HL1606. HL1606 is a LED driver IC with SPI controlled. We can get complex mode changes by fewer data. No. Name Description No.

Chapter 2 Logic Gates and Introduction to Computer Architecture

Theory of Logic Circuits. Laboratory manual. Exercise 3

Sequential 4-bit Adder Design Report


Linearly Independent Sets and Linearly Dependent Sets

Physics 120 Lab 6: Field Effect Transistors - Ohmic region


Counters and Decoders

Solving Systems of Linear Equations Using Matrices

Gate Delay Model. Estimating Delays. Effort Delay. Gate Delay. Computing Logical Effort. Logical Effort

5 Systems of Equations

ELEC EXPERIMENT 1 Basic Digital Logic Circuits

Partial Fractions Decomposition

Design of Low Power One-Bit Hybrid-CMOS Full Adder Cells

Lecture 30: Biasing MOSFET Amplifiers. MOSFET Current Mirrors.

CDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012

3.6. Partial Fractions. Introduction. Prerequisites. Learning Outcomes

Experiment #5, Series and Parallel Circuits, Kirchhoff s Laws

Ladder and Functional Block Programming

Chapter 2: Boolean Algebra and Logic Gates. Boolean Algebra

2.0 Chapter Overview. 2.1 Boolean Algebra

Common sense, and the model that we have used, suggest that an increase in p means a decrease in demand, but this is not the only possibility.

Fibonacci Numbers and Greatest Common Divisors. The Finonacci numbers are the numbers in the sequence 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144,...

Equations, Inequalities & Partial Fractions

CMOS Logic Integrated Circuits

Linear Programming Notes V Problem Transformations

Analog & Digital Electronics Course No: PH-218

CHAPTER 16 MEMORY CIRCUITS

DEGREE: Bachelor in Biomedical Engineering YEAR: 2 TERM: 2 WEEKLY PLANNING

International Journal of Electronics and Computer Science Engineering 1482

Bob York. Transistor Basics - MOSFETs

CS311 Lecture: Sequential Circuits

2.6 Exponents and Order of Operations

Take-Home Exercise. z y x. Erik Jonsson School of Engineering and Computer Science. The University of Texas at Dallas

Interfacing 3V and 5V applications

MULTIPLICATION AND DIVISION OF REAL NUMBERS In this section we will complete the study of the four basic operations with real numbers.

Preamble. Kirchoff Voltage Law (KVL) Series Resistors. In this section of my lectures we will be. resistor arrangements; series and

Layout of Multiple Cells

Unit 3 Boolean Algebra (Continued)

5.5. Solving linear systems by the elimination method

HT7660. CMOS Switched-Capacitor Voltage Converter. Features. Applications. General Description. Block Diagram

Fig6-22 CB configuration. Z i [6-54] Z o [6-55] A v [6-56] Assuming R E >> r e. A i [6-57]

Introduction to CMOS VLSI Design

CSE140: Components and Design Techniques for Digital Systems. Introduction. Prof. Tajana Simunic Rosing

BJT Amplifier Circuits

Transcription:

11/14/2004 section 10_3 CMOS Logic Gate Circuits blank.doc 1/1 10.3 CMOS Logic Gate Circuits Reading ssignment: pp. 963-974 Q: Can t we build a more complex digital device than a simple digital inverter? : HO: CMOS Device Structure Q: : HO: Synthesis of CMOS Gates HO: Examples of CMOS Logic Gates Example: CMOS Logic Gate Synthesis Example: nother CMOS Logic Gate Synthesis

11/14/2004 CMOS Device Structure.doc 1/4 CMOS Device Structure For every CMOS device, there are essentially two separate circuits: 1) The Pull-Up Network 2) The Pull-Down Network The basic CMOS structure is: V DD C PUN D Inputs Y = f (,,C,D) C D PDN Output CMOS logic gate must be in one of two states!

11/14/2004 CMOS Device Structure.doc 2/4 State 1: PUN is open and PDN is conducting. V DD PUN PDN Y =0 In this state, the output is LOW (i.e., Y =0). State 2: PUN is conducting and PDN is open. V DD PUN Y =0 In this state, the output is HIGH (i.e.,y =1). PDN

11/14/2004 CMOS Device Structure.doc 3/4 Thus, the PUN and the PDN essentially act as switches, connecting the output to either V DD or to ground: V DD V DD Y =0 OR Y =V DD * Note that the key to proper operation is that one switch must be closed, while the other must be open. * oth switches closed or both switches open would cause an ambiguous digital output! * To prevent this from occurring, the PDN and PUN must be complementary circuits.

11/14/2004 CMOS Device Structure.doc 4/4 For example, consider the CMOS inverter: V DD PUN Y = PDN For more complex digital CMOS gates (e.g., a 4-input OR gate), we find: 1) The PUN will consist of multiple inputs, therefore requires a circuit with multiple PMOS transistors. 2) The PDN will consist of multiple inputs, therefore requires a circuit with multiple NMOS transistors.

11/14/2004 Synthesis of CMOS Gates.doc 1/4 Synthesis of CMOS Gates Let s consider the design synthesis of CMOS gates by considering the design synthesis of PUN and PDN separately. PDN Design Synthesis 1. If the PDN is conducting, then the output will be low. Thus, we must find a oolean expression for the complemented output Y. In turn, the PDN can only be conducting if one or more of the NMOS devices are conducting and NMOS devices will be conducting (i.e., triode mode) when the inputs are high (V GSN =V DD ). Thus, we must express Y in terms of un-complemented inputs Y = f,,c ).,, C, etc (i.e., ( ) e.g., Y = + C This step may test our oolean algebraic skills!

11/14/2004 Synthesis of CMOS Gates.doc 2/4 2. Then, we realize ND operations in Y f (,,C ) series NMOS devices. E.G.: = with Y PDN Note that Y =0 if both = V DD ND = V DD. Y = 3. Likewise, we realize OR operations with parallel NMOS devices. E.G.: Y Note that Y =0 if either = V DD OR = V DD. Y = + PDN

11/14/2004 Synthesis of CMOS Gates.doc 3/4 PUN Design Synthesis 1. If the PUN is conducting, then the output will be high. Thus, we must find a oolean expression for the uncomplemented output Y. In turn, the PUN can only be conducting if one or more of the PMOS devices are conducting and PMOS devices will be conducting (i.e., triode mode) when the inputs are low (V GSP = -V DD ). Thus, we must express Y in terms of complemented inputs Y = f,,c ).,, C, etc (i.e., ( ) e.g., Y = + C This step may test our oolean algebraic skills!

11/14/2004 Synthesis of CMOS Gates.doc 4/4 2. Then, we realize ND operations with series PMOS devices. E.G.: V DD PUN Note that Y =V DD if both = 0 ND = 0. Y = Y 3. Likewise, we realize OR operations with parallel PMOS devices. E.G.: V DD Note that Y = V DD if either = 0 OR =0. PUN Y = + Y

11/14/2004 Examples of CMOS Logic Gates.doc 1/3 Examples of CMOS Logic Gates See if you can determine the oolean expression that describes these pull-down networks: See now if you can determine the oolean algebraic expression for these pull-up networks:

11/14/2004 Examples of CMOS Logic Gates.doc 2/3 Now, we will make a simplifying change of symbols: Effectively, these symbols represent the fact that we are now considering MOSFETs as switches, which can be placed either in an open state or a conducting state. Note there are two kinds of switches the ones that conduct when the input is high (i.e., NMOS) and ones that conduct when the input is low (i.e., PMOS).

11/14/2004 Examples of CMOS Logic Gates.doc 3/3 nd now consider these logic gates: Note the PUN and the PDN for each of these circuits have equivalent oolean expressions (make sure you see this!).

11/14/2004 Example CMOS Logic Gate Synthesis.doc 1/6 Example: CMOS Logic Gate Synthesis Problem: Design a CMOS digital circuit that realizes the oolean function: Y = + + C Solution: Follow the steps of the design synthesis handout! Step1: Design the PDN First, we must rewrite the oolean function as: ( ) Y = f,,c In other words, write the complemented output in terms of un-complemented inputs. Time to recall our oolean algebra skills!

11/14/2004 Example CMOS Logic Gate Synthesis.doc 2/6 We must first complement this equation, and then apply DeMorgan s Theorem (several times!). Y = + + C Y = + + C ( )( C ) ( )( C ) = + Logically, this result says: = + + ( )( C ) = + + = + C + + C ( ) = + + C + C = + C Y is low if is high, OR if both ND C are high. We can thus realize this logic with the following NMOS PDN:

11/14/2004 Example CMOS Logic Gate Synthesis.doc 3/6 Y PDN C Y = + C Step2: Design the PUN First, we must rewrite the oolean function as: ( ) Y = f,,c In other words, write the un-complemented output in terms of complemented inputs.

11/14/2004 Example CMOS Logic Gate Synthesis.doc 4/6 gain, using DeMorgan s Theorem: Logically, this result says: Y = + + C = + C ( C ) = + Y is high if is low ND either OR C are low. We can thus realize this logic with the following PMOS PUN:

11/14/2004 Example CMOS Logic Gate Synthesis.doc 5/6 V DD C PUN Y = ( + C ) Y Thus, the entire CMOS realization is:

11/14/2004 Example CMOS Logic Gate Synthesis.doc 6/6 V DD C Y = + + C C

11/14/2004 Example nother CMOS Logic Gate Synthesis.doc 1/4 Example: nother CMOS Logic Gate Synthesis Now let s design a gate that realizes this oolean algebraic expression: Step 1: Design PDN Y = ( + ) C First, let s rewrite oolean expression as Y f (,,C) ( ) ( ) Y = + C Y = + C ( ) Y = + + C Y = + C = : Q: Yikes! We cannot write this expression explicitly in terms of uncomplemented inputs,, and C! The input C appears as C in the expression. What do we do now? : n easy problem to solve! We can essentially make a substitution of variables: C = C

11/14/2004 Example nother CMOS Logic Gate Synthesis.doc 2/4 nd thus: Y = + C Therefore, the inputs to this logic gate should be,, and C (i.e,,, and the complement of C ). Note that this oolean expression says that: The ouput is low if either, ND are both high, OR C is high Of course another way of saying this is: The output is low if either ND are both high, OR C is low The PDN is therefore: Y Y = + C = + C C = C

11/14/2004 Example nother CMOS Logic Gate Synthesis.doc 3/4 Step 2: Design the PUN Note we have as similar problem as before the expression for Y cannot explicitly be written in terms of complemented inputs and C,, : Y = ( + ) C Note we can again solve this problem by using the same substitution of variable C: C = C C = C Therefore: ( ) ( ) Y = + C = + C This expression says that: The output will be high if, either OR are low, ND C is low Which is equivalent to saying: The output will be high if, either OR are low, ND C is high The CMOS digital logic device is therefore:

11/14/2004 Example nother CMOS Logic Gate Synthesis.doc 4/4 V DD C = C Y ( ) ( ) ( ) Y = + C = + C = + C C = C