CS 140L Lecture 1 Professor CK Cheng 3/31/02. CMOS Logic (3.2 – 3.6) Complementary Metal-Oxide Semiconductor.

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

Logic Gates.
Digital CMOS Logic Circuits
Logic Gates.
L14: Boolean Logic and Basic Gates
CSE 20 Lecture 9 Boolean Algebra: Theorems and Proofs CK Cheng April 26, 2011 Lecture notes 1.
CSET 4650 Field Programmable Logic Devices
Logical Design.
CSIS 3510 Computer Organization and Architecture Topics covered in this lecture: –Review of De’Morgan’s Theorem –Using De’Morgan’s Theorem –Building a.
Morgan Kaufmann Publishers
IEEE’s Hands on Practical Electronics (HOPE) Lesson 9: CMOS, Digital Logic.
Pass Transistor Logic. Agenda  Introduction  VLSI Design methodologies  Review of MOS Transistor Theory  Inverter – Nucleus of Digital Integrated.
EE 4271 VLSI Design, Fall 2011 CMOS Combinational Gate.
Digital Circuits 3.1 Logic Signals and Gates 3.2 Logic Families 3.3 CMOS Logic 3.5* CMOS /TTL Interfacing 3.4 Bipolar Logic Return AbbreviationExercises.
CS 140 Lecture 6: Other Types of Gates Professor CK Cheng 1.
Lecture 14 Today we will Learn how to implement mathematical logical functions using logic gate circuitry, using Sum-of-products formulation NAND-NAND.
Lecture 21 Today we will Revisit the CMOS inverter, concentrating on logic 0 and logic 1 inputs Come up with an easy model for MOS transistors involved.
Integrated Circuits CSE 495/595 Review Supplement.
Physical States for Bits. Black Box Representations.
Lecture 1: Introduction to Digital Logic Design CK Cheng Thursday 9/26/02.
CS 140L Lecture 9 Professor CK Cheng 6/03/02. transistors modules sequential machine system 1.Adders, Muxes 2.F-Fs and counters 3.Finite State Machine.
Faculty of Computer Science © 2006 CMPUT 229 Digital Logic From Switches to Memories.
10/25/2004EE 42 fall 2004 lecture 231 Lecture #23 Synthesis Next week: Converting gates into circuits.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 5 Dr. Shi Dept. of Electrical and Computer Engineering.
10-7 Metal-Oxide Semiconductor ( MOS )  Field-Effect Transistor ( FET ) Unipolar transistor Depend on the flow of only one type of carrier JFET, MOS 
CS 140 Lecture 7 Professor CK Cheng 10/17/02. Combinational Logic  Complete set of gates  Other types of gates 1)XOR 2)NAND / NOR 3)Block Diagram Transfers.
1 CSE 20: Lecture 7 Boolean Algebra CK Cheng 4/21/2011.
Prof. Kavita Bala and Prof. Hakim Weatherspoon CS 3410, Spring 2014 Computer Science Cornell University See: P&H Appendix B.2 and B.3 (Also, see B.0 and.
Gates and Logic: From switches to Transistors, Logic Gates and Logic Circuits Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University.
ECE 331 – Digital System Design Transistor Technologies, and Realizing Logic Gates using CMOS Circuits (Lecture #23)
EE 5900 Advanced Algorithms for Robust VLSI CAD, Spring 2009
MOS Transistors The gate material of Metal Oxide Semiconductor Field Effect Transistors was original made of metal hence the name. Present day devices’
We know binary We know how to add and subtract in binary –Same as in decimal Next up: learn how apply this knowledge Boolean and Binary Inputs.
Field Effect Transistors: Operation, Circuit Models, and Applications AC Power CHAPTER 11.
Digital Electronics Lecture 6 Combinational Logic Circuit Design.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
F = ABD + ABD + ABD + BCD _ __ _ _ Another thing about Karnaugh Maps… 1 A D C B The two blue.
ECE442: Digital ElectronicsSpring 2008, CSUN, Zahid Static CMOS Logic ECE442: Digital Electronics.
ECE2030 Introduction to Computer Engineering Lecture 4: CMOS Network Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering Georgia Tech.
EE210 Digital Electronics Class Lecture 9 April 08, 2009.
Boolean Logic and Circuits ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.
1 Transistors, Boolean Algebra Lecture 2 Digital Design and Computer Architecture Harris & Harris Morgan Kaufmann / Elsevier, 2007.
Brief Introduction to Boolean Algebra We can use transistors to build AND, OR, NAND, NOR, and Invertors Manufacturing is simplified with NAND/NOR NAND/NOR.
CSE 20: Lecture 7 Boolean Algebra CK Cheng
Prof. Hakim Weatherspoon CS 3410, Spring 2015 Computer Science Cornell University See: P&H Appendix B.2 and B.3 (Also, see B.1)
Lecture 4 Introduction to Boolean Algebra. Binary Operators In the following descriptions, we will let A and B be Boolean variables and define a set of.
Boolean Algebra and Logic Gates
Logic Gates. AND gate Produces an output only if both inputs are on Input AInput BOutput (Q) Q=
EECS 270: Inside Logic Gates (CMOS)
Solid-State Devices & Circuits
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.
CSE 140: Components and Design Techniques for Digital Systems Lecture 6: Universal Gates CK Cheng Dept. of Computer Science and Engineering University.
1 Digital Design Debdeep Mukhopadhyay Associate Professor Dept of Computer Science and Engineering NYU Shanghai and IIT Kharagpur.
1 ECE2030 Introduction to Computer Engineering Lecture 4: CMOS Network Prof. Hsien-Hsin Sean Lee School of ECE Georgia Institute of Technology.
Boolean Algebra ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.
Computer Organization and Design Transistors & Logic - II Montek Singh Mon, Mar 14, 2011 Lecture 9.
1 Lecture 24 Transistors A look ahead Course summary.
NAND, NOR, and EXOR (more primitive logical gates) CS Computer Architecture David Mayer.
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
Computer Organization and Design Transistors & Logic - II Montek Singh Wed, Oct 17, 2012 Lecture 11.
LOGIC GATE TIMING DIAGRAM.
Logic Gates.
Week 7: Gates and Circuits: PART II
Logic Gates.
Chapter 4 Gates and Circuits.
Chapter 2 Gates.
CS 140 Lecture 6: Other Types of Gates
Special Gates Combinational Logic Gates
CS 140L Lecture 1 Professor CK Cheng 10/2/02.
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Presentation transcript:

CS 140L Lecture 1 Professor CK Cheng 3/31/02

CMOS Logic (3.2 – 3.6) Complementary Metal-Oxide Semiconductor

1. Transistors (FET) Field Effect Transistor G S D NMOS D WG S D L G =1 => D =S { D = 1 => S = 0.8 D = 0 => S = 0 G = 0 => D&S are separated.

G C D S r L W, c WxL A C ’ C B G S D PMOS G = 0 => D =S { D = 1 => S = 1 D = 0 => S = 0.2 G = 1 => D&S are separated.

2. Transmission Gate A C C BC = 0 => A&B are separated. C = 1 => A = B

3. Inverter AB A = 1 => B = 0 A = 0 => B = 1 Thus B = A

4. NAND gate B A A B A B Z Z = D iff AB = 1. Z = (AB)’ Z

5. NOR gate B A A B A B Z Z = 1 iff A+B = 0. Z = (AB)’ = (A+B)’ Z

6. XOR gate B A Z B’ A’ B A B’ A’ Z = ab’ + a’b = a + b

7. Multiplexer d1 d2 S S S ‘ Z If S=1, Z = d1 Else (S=0), Z = d0 Z = S d1 + S’ d0

Basic Boolean Algebra a + a = 1 a * a = a = 1 1*a = 1 a + a = a a * a = a a a

DeMorgan’s Law (a + b)’ = a’ * b’ (a*b)’ = a’ + b’ ab