Presentation is loading. Please wait.

Presentation is loading. Please wait.

240-451 VLSI lecture, 2000 Lecture 4 MOS Circuits Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut.

Published byDashawn Twitchell Modified over 10 years ago

Similar presentations

Presentation on theme: "240-451 VLSI lecture, 2000 Lecture 4 MOS Circuits Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut."— Presentation transcript:

1 240-451 VLSI lecture, 2000 Lecture 4 MOS Circuits Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut

2 240-451 VLSI lecture, 2000 Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut Combination & Sequential

3 240-451 VLSI lecture, 2000 Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut Combination & Sequential

4 240-451 VLSI lecture, 2000 Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut CMOS logic style

5 240-451 VLSI lecture, 2000 Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut Example NAND gate

6 240-451 VLSI lecture, 2000 Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut 4-input NAND gate

7 240-451 VLSI lecture, 2000 Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut Example : NOR gate

8 240-451 VLSI lecture, 2000 Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut Complex CMOS gate

9 240-451 VLSI lecture, 2000 Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut Complex gate structures A C B A B C Vdd Gnd Out Out = A+(B*C)... A B C And-Or-Invert (AOI) How to add terms?

10 240-451 VLSI lecture, 2000 Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut A C B A B C Vdd Gnd Out Out = A+(B*C)... A B C And-Or-Invert (AOI) How to add terms? OAI/AOI duality

11 240-451 VLSI lecture, 2000 Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut Demorgans law in action Out = A*(B+C)... A B C Or-And-Invert (OAI) A C B A B C Vdd Gnd Out

12 240-451 VLSI lecture, 2000 Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut Demorgans law in action Out = A*(B+C)... A B C Or-And-Invert (OAI) A C B A B C Vdd Gnd Out

13 240-451 VLSI lecture, 2000 Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut Demorgans law in action Out = A*(B+C)... A B C Or-And-Invert (OAI) A C B A B C Vdd Gnd Out

14 240-451 VLSI lecture, 2000 Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut Demorgans law in action Out = A*(B+C)... A B C Or-And-Invert (OAI) A C B A B C Vdd Gnd Out

15 240-451 VLSI lecture, 2000 Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut Demorgans law in action Out = A*(B+C)... A B C Or-And-Invert (OAI) A C B A B C Vdd Gnd Out What is the Magic command to do this?

16 240-451 VLSI lecture, 2000 Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut OAI/AOI duality A C B A B C Vdd Gnd Out A C B A B C Vdd Gnd Out

17 240-451 VLSI lecture, 2000 Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut Step by step layout XNOR gate The equation for XNOR is: –f = (a * b) + (a' * b') using DeMorgan's law on each of the two terms gives: –f = (a'+ b')' + (a + b)' using DeMorgan's law on the two terms together gives: –f = ((a'+ b') * (a + b))' This could be directly implemented with a single complementary CMOS gate: the equation is in a simple negated product of sums form. This form can be implemented with the standard Or-And-Invert (OAI) style gate.

18 240-451 VLSI lecture, 2000 Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut Non-inverter input However, using DeMorgan's law one more time on the left term gives: –f = ((a * b)' * (a + b)) This form uses no inverted inputs and can be implemented with two gates a NAND gate and an OAI gate. a b f

19 240-451 VLSI lecture, 2000 Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut Logic Graph

20 240-451 VLSI lecture, 2000 Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut Example CMOS

21 240-451 VLSI lecture, 2000 Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut Complex CMOS graph

Download ppt "240-451 VLSI lecture, 2000 Lecture 4 MOS Circuits Department of Computer Engineering, Prince of Songkla University by Wannarat Suntiamorntut."

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.

Modern VLSI Design 3e: Chapter 3 Copyright 1998, 2002 Prentice Hall PTR Topics n Combinational logic functions. n Static complementary logic gate structures.
Digital Integrated Circuits© Prentice Hall 1995 Combinational Logic COMBINATIONAL LOGIC.

Digital Integrated Circuits© Prentice Hall 1995 Combinational Logic COMBINATIONAL LOGIC.
Introduction to Computer Engineering ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin.

Introduction to Computer Engineering ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin.
Static CMOS Circuits.

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.

FPGA-Based System Design: Chapter 2 Copyright 2003 Prentice Hall PTR Gate Design n Static complementary logic gate structures. n Switch logic. n Other.
L14: Boolean Logic and Basic Gates

L14: Boolean Logic and Basic Gates
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 3.

Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 3.
HDL Programming Fundamentals

HDL Programming Fundamentals
Morgan Kaufmann Publishers

Morgan Kaufmann Publishers
Multiplexer as a Universal Function Generator Lecture L6.7 Section 6.2.

Multiplexer as a Universal Function Generator Lecture L6.7 Section 6.2.
ELEC 2200-002 Digital Logic Circuits Fall 2014 Logic Synthesis (Chapters 2-5) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and.

ELEC Digital Logic Circuits Fall 2014 Logic Synthesis (Chapters 2-5) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and.
Lecture: 1.6 Tri-states, Mux, Latches & Flip Flops

Lecture: 1.6 Tri-states, Mux, Latches & Flip Flops
ECE2030 Introduction to Computer Engineering Lecture 9: Combinational Logic, Mixed Logic Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering.

ECE2030 Introduction to Computer Engineering Lecture 9: Combinational Logic, Mixed Logic Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering.
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 Topics n Combinational logic functions n Static complementary logic gate structures.
Design and Implementation of VLSI Systems (EN0160) lecture03 Sherief Reda Division of Engineering, Brown University Spring 2008 [sources: Weste/Addison.

Design and Implementation of VLSI Systems (EN0160) lecture03 Sherief Reda Division of Engineering, Brown University Spring 2008 [sources: Weste/Addison.
CS 140L Lecture 1 Professor CK Cheng 3/31/02. CMOS Logic (3.2 – 3.6) Complementary Metal-Oxide Semiconductor.

CS 140L Lecture 1 Professor CK Cheng 3/31/02. CMOS Logic (3.2 – 3.6) Complementary Metal-Oxide Semiconductor.
Introduction to Computer Engineering by Richard E. Haskell Basic Logic Gates Module M1.1 Section 3.1.

Introduction to Computer Engineering by Richard E. Haskell Basic Logic Gates Module M1.1 Section 3.1.
TDC 311 Digital Logic. Truth Tables  AND  OR  NOT  NAND  NOR  XOR  XNOR.

TDC 311 Digital Logic. Truth Tables  AND  OR  NOT  NAND  NOR  XOR  XNOR.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 5 Dr. Shi Dept. of Electrical and Computer Engineering.

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 5 Dr. Shi Dept. of Electrical and Computer Engineering.
240-451 VLSI lecture, 2000 240-451 - Semester I, 2000 Basic VLSI design systems and circuits Department of Computer Engineering, Prince of Songkla University.

VLSI lecture, Semester I, 2000 Basic VLSI design systems and circuits Department of Computer Engineering, Prince of Songkla University.

Similar presentations

Ads by Google