Circuits using NMOS and PMOS enhancement mode FETs

Slides:



Advertisements
Similar presentations
Logical Functions Circuits using NMOS and PMOS enhancement mode FETs.
Advertisements

Logic Gates.
Programmable Logic Controllers.
Static CMOS Gates Jack Ou, Ph.D.
Unit 8 Combination Circuits
Morgan Kaufmann Publishers
Discussion D2.5 Sections 2-9, 2-11
Boolean rules for simplification Dr. Ahmed Telba.
Lecture #24 Gates to circuits
Field-Effect Transistors 1.Understand MOSFET operation. 2. Understand the basic operation of CMOS logic gates. 3. Make use of p-fet and n-fet for 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.
Combinational Digital Circuits. Measurement Our world is an analog world. Measurements that we make of the physical objects around us are never in discrete.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
LOGIC GATES AND CIRCUITS Digital systems are said to be constructed by using logic gates. These gates are the AND, OR, NOT, NAND, NOR, EXOR and EXNOR gates.
Linear Algebra. Circuits The circuits in computers and other input devices have inputs, each of which is either a 0 or 1, the output is also 0s and 1s.
Basic Digital Logic: NAND and NOR Gates Technician Series ©Paul Godin Last Update Dec 2014.
Logic Gates. A logic gate is an elementary building block of a digital circuit. Most logic gates have two inputs and one output. At any given moment,
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.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. De Morgan’s Theorem De Morgan’s Theorem.
DeMorgan’s Theorem DeMorgan’s 2 nd Theorem The complement of a sum of variables is equal to the product of the complemented variables. A + B = A. B Applying.
Chapter 5 Boolean Algebra and Reduction Techniques 1.
Introduction to Digital Electronics
Combinational Circuits Part 1
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Chapter 3 Notes – Part II Review Questions
Static and Transient Analysis of Gates
COMP541 Combinational Logic - II
Unit 2 Boolean Algebra.
ECE2030 Introduction to Computer Engineering Lecture 4: CMOS Network
Boolean Algebra & De Morgan's Theorems
STICK Diagrams UNIT III : VLSI CIRCUIT DESIGN PROCESSES VLSI DESIGN
VLSI System Design Lecture: 1.3 COMS LOGICs
HW#10 will be posted tonight
EI205 Lecture 5 Dianguang Ma Fall 2008.
Recall Lecture 17 MOSFET DC Analysis
Pass Transistor Logic We want to transfer a logic 1 using the circuit below. Assume Vin = VDD, Vg makes a transition from 0V to VDD and at t=0 Vx = 0V.
Field effect Transistors: Operation, Circuit, Models, and Applications
Boolean Algebra.
CHAPTER 3 SETS AND BOOLEAN ALGEBRA
Reading: Hambley Ch. 7; Rabaey et al. Sec. 5.2
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Computer Science 210 Computer Organization
HW#10 will be posted tonight
Logic Gates L Al-zaid Math110.
NMOS Inverter UNIT II : BASIC ELECTRICAL PROPERTIES Sreenivasa Rao CH
Design Technologies Custom Std Cell Performance Gate Array FPGA Cost.
Basic electrical properties
CMOS Combinational Gate
Design of Combinational Logic
Recall Last Lecture The MOSFET has only one current, ID
Recall Lecture 17 MOSFET DC Analysis
CMOS Combinational Gate
COMBINATIONAL LOGIC DESIGN
Lecture 19 OUTLINE The MOS Capacitor (cont’d) The MOSFET:
Introduction to Wiring Logic Gates
Boolean Algebra.
Universal Gate – NOR Universal Gate - NOR Digital Electronics
EENG447 Digital IC Design Dr. Gürtaç Yemişcioğlu.
Logic Gates Dr.Halimah Alshehri.
CMOS Combinational Gate
Elec 2607 Digital Switching Circuits
Lecture 19 OUTLINE The MOS Capacitor (cont’d) The MOSFET:
BES2016 Pre-course test revealed
COMP541 Combinational Logic - II
Recall Last Lecture The MOSFET has only one current, ID
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Copyright © Cengage Learning. All rights reserved.
Combinational Logic Circuit
Circuit Theorems.
Presentation transcript:

Circuits using NMOS and PMOS enhancement mode FETs Logical Functions Circuits using NMOS and PMOS enhancement mode FETs

Rules Each logical gate has its own load resistor or saturated load. Each ‘bar’ in the function should be implemented as a separate logical gate. If the function does not have a bar over the entire Boolean expression, then the final gate is an inverter.

NMOS Logic Determine how many bars there are in the circuit. The sum of the bars is equal to the number of individual logical gates that will be needed to implement the function. If there is a missing bar over the entire Boolean function, draw two bars over the entire function. Working from the smallest grouping to the complete Boolean function, begin drawing logical gates.

NMOS Logical Gate Layout Logical ANDs are NMOSFETs in series and logical ORs are NMOSFETs in parallel. An individual variable with a bar over it means that the unbarred variable is an input to an inverter. Place load above and the NMOS devices below the output terminal. If the logical expression implemented in the grouping of FETs is part of a larger expression, the output terminal should be connected to the gate of a FET in the next logical gate.

PMOS Logical Gate Layout If you have implemented the circuit as an NMOS logical circuit, then you can redraw it using PMOSFETs. Logical ANDs are PMOSFETs in parallel and logical ORs are PMOSFETs in series. Change any parallel groups of NMOSFETs to groups of PMOSFETs in series. Change any series groups of NMOSFETs to groups of PMOSFETs in parallel. Place load below and the PMOS devices above the output terminal. As with the NMOS logic: If the logical expression implemented in the grouping of FETs is part of a larger expression, the output terminal should be connected to the gate of a FET in the next logical gate.

Directly Implementing PMOS Logic Use DeMorgan’s Theorem to redistribute the bars in the logical expression. DeMorgan’s Theorem can be applied to small groupings of variables that are barred within the Boolean Expression. Or, the output of the logical function that implements the small expression should be tied to a PMOS inverter before implementing the next larger grouping of variable.

PMOS Logic: DeMorgan’s Theorem Variables that are barred should be connected directly to the gate of a PMOSFET. Variables that are missing a bar should be connected to a PMOSFET inverter. Logical ANDs are PMOSFETs in series and logical ORs are PMOSFETs in parallel.

NMOS When both MA and MB are turned on, Vo is pulled down towards ground. When either MA and MB or off, ML pulls Vo up to VDD. When either MA or MB is turned on, Vo is pulled down towards ground. When both MA and MB are off, ML pulls Vo up to VDD.

PMOS When both MA and MB is turned on, Vo is pulled up to VDD. When either MA or MB are off, ML pulls Vo down towards 0V. When either MA or MB is turned on, Vo is pulled up to VDD. When both MA and MB are off, ML pulls Vo down towards 0V.

Writing a Boolean Function NMOS circuit Inputs to each gate are written as is. All paths to ground are OR’ed together. All FETs in series along the path are AND’ed together. Place a bar over the entire function implemented in the circuit. PMOS circuit Inputs to each gate are written with a bar over them. All paths to VDD are OR’ed together. Do not place bar over the entire function implemented in the circuit.