ECE 3060 VLSI and Advanced Digital Design Lecture 5 Complex Gates - - PowerPoint PPT Presentation

ece 3060 vlsi and advanced digital design
SMART_READER_LITE
LIVE PREVIEW

ECE 3060 VLSI and Advanced Digital Design Lecture 5 Complex Gates - - PowerPoint PPT Presentation

ECE 3060 VLSI and Advanced Digital Design Lecture 5 Complex Gates Example: NAND Gate (Vertical) ECE 3060 Lecture 52 Example: NAND Gate (Horizontal) ECE 3060 Lecture 53 Other Gates And Or Invert (AOI) Or And Invert (OAI)


slide-1
SLIDE 1

ECE 3060 VLSI and Advanced Digital Design

Lecture 5 Complex Gates

slide-2
SLIDE 2

ECE 3060 Lecture 5–2

Example: NAND Gate (Vertical)

slide-3
SLIDE 3

ECE 3060 Lecture 5–3

Example: NAND Gate (Horizontal)

slide-4
SLIDE 4

ECE 3060 Lecture 5–4

Other Gates

  • And Or Invert (AOI)
  • Or And Invert (OAI)
  • XOR
  • XNOR
slide-5
SLIDE 5

ECE 3060 Lecture 5–5

Complex Gates

  • The gate “function” does not need to be primitive, or

symmetric

  • Any

may be implemented

  • Algorithm:
  • 1. put

in form with only AND, OR, and literals (use DeMorgans).

  • 2. compute

using generalized DeMorgan’s Theorem

  • 3. construct complimentary networks using transistors in series for AND, and

transistors in parallel for OR

  • Note: There are many correct networks due to commu-

tivity f x ( ) f x ( ) f

slide-6
SLIDE 6

ECE 3060 Lecture 5–6

Euler Paths

  • Mapping CMOS Circuits to Graphs
  • Circuit Nodes Map to Graph Vertices
  • Transistors Map to Graph Edges
  • Complementary Circuit Networks Map to Dual Graphs

A C A B C B

Out

Vdd

O t Gnd Out A B C

slide-7
SLIDE 7

ECE 3060 Lecture 5–7

Euler Paths

  • Finding Euler Paths
  • Find All Euler Paths
  • Find an n and a p Euler Path with Identical Labeling
  • If No Identical Labeling, Break the Path Minimally

Vdd

Out Gnd Out A B C A B C

  • rder = B, A, C
slide-8
SLIDE 8

ECE 3060 Lecture 5–8

Describing an Euler Path

  • While an ordered list of edges only suffice to denote

an Euler path, a complete description is an ordered list

  • f nodes and edges
  • For example: Path = {Vdd, A, I1, B, Out, C, Vdd}
  • This form is useful for layout purposes
slide-9
SLIDE 9

ECE 3060 Lecture 5–9

Euler Path to Layout

  • Map Euler Paths to CMOS Layout
  • Place Busses
  • Place Transistors
  • Complete Wiring
slide-10
SLIDE 10

ECE 3060 Lecture 5–10

Standard Cell Layout

  • In general, when laying out standard cells or other

custom gate designs, there may not exist a Euler Path

  • e.g.,
  • Standard cells for a particular process (e.g., .35u HP

CMOS) need not follow lamda spacing rules

  • There are companies whose sole purpose is the cre-

ation and maintenance of standard cell libraries

  • Custom layout is very time-intensive and laborious for

large chips; therefore, custom layout is typically done

  • nly for critical paths
  • Read Chapters 3, 4 and 7 of Wolf

AB CD + ( )E

slide-11
SLIDE 11

Complex Gate vs Network of Gates

  • Complex gate implementation of

d c ab F + + =

slide-12
SLIDE 12

Complex Gate vs Network of Gates

  • Network of NAND2/INV implementation