2017 Ch3-2-Circuit Layout Rev1 Euler
2017 Ch3-2-Circuit Layout Rev1 Euler
2017 Ch3-2-Circuit Layout Rev1 Euler
Circuits &
Layout
Outline
CMOS Gate Design
Pass Transistors
CMOS Latches & Flip-Flops
Standard Cell Layouts
Stick Diagrams
A
B
C
D
Y
nMOS
pull-down
network
Pull-up OFF Pull-up ON
Pull-down OFF Z (float) 1
Pull-down ON 0 X (crowbar)
VDD
PMOS transistors only
In1
pull-up: make a connection from VDD to F
In2 PUN
when F(In1,In2,…InN) = 1
InN
F(In1,In2,…InN)
In1
pull-down: make a connection from F to
In2 PDN
GND when F(In1,In2,…InN) = 0
InN
NMOS transistors only
VDD VDD
PUN
VDD
0 0
CL CL
CL CL
VDD
VDD VDD
PUN
S D
VDD
S D
A•B
A
A+B
A B
g2
pMOS: 0 = ON b
0
b
1
b
0
b
1
b
(a) OFF OFF OFF ON
0
0
1
1
0
1
1
b b b b b
(b) ON OFF OFF OFF
a a a a a
g1 g2 0 0 0 1 1 0 1 1
b b b b b
(c) OFF ON ON ON
a a a a a
g1 g2 0 0 0 1 1 0 1 1
b b b b b
(d) ON ON ON OFF
A B F
0 0 1
A B
0 1 1
1 0 1
A•B
1 1 0
A
A
B
A B F
B
0 0 1
A 0 1 0
1 0 0
A+B
1 1 0
A B
A
B
C D
A B C D
A B
(c)
(d)
C D
A
A B
B
Y Y
C
A C
D
B D
(f)
(e)
A
B
C D
Y
D
A B C
A
D
B C
B
A
C
D
OUT = !(D + A • (B + C))
A
D
B C
C
SN1 F SN4 A
F
SN2 B
A A
D D SN3
B C B C D
Routing
channel
VDD
signals
GND
GND GND
INV NAND3
40
32
Stick Diagrams
Objectives:
• To know what is meant by stick diagram.
• To understand the capabilities and limitations of stick
diagram.
• To learn how to draw stick diagrams for a given MOS
circuit.
Outcome:
• At the end of this module the students will be able
draw the stick diagram for simple MOS circuits.
34
S.N.Bhat, Faculty, Dept. of E&C Engineering, M.I.T Manipal
Stick Diagrams
Stick Diagrams
N+ N+
35
S.N.Bhat, Faculty, Dept. of E&C Engineering, M.I.T Manipal
Stick Diagrams
Stick Diagrams
VDD
VDD
X
X
x Stick x x
x Diagram X
Gnd Gnd
36
S.N.Bhat, Faculty, Dept. of E&C Engineering, M.I.T Manipal
Stick Diagrams
Stick Diagrams
VDD
VDD
X
X
x x x
x X
Gnd Gnd
37
S.N.Bhat, Faculty, Dept. of E&C Engineering, M.I.T Manipal
Stick Diagrams
Stick Diagrams
Stick Diagrams
39
S.N.Bhat, Faculty, Dept. of E&C Engineering, M.I.T Manipal
Stick Diagrams
Stick Diagrams
40
S.N.Bhat, Faculty, Dept. of E&C Engineering, M.I.T Manipal
Stick Diagrams
Metal 1
poly
ndiff
pdiff
Can also draw
in shades of
gray/line style.
41
Stick Diagrams
42
Stick Diagrams
43
Stick Diagrams
45
S.N.Bhat, Faculty, Dept. of E&C Engineering, M.I.T Manipal
Stick Diagrams
46
S.N.Bhat, Faculty, Dept. of E&C Engineering, M.I.T Manipal
Stick Diagrams
47
S.N.Bhat, Faculty, Dept. of E&C Engineering, M.I.T Manipal
Stick Diagrams
Power
A Out
Ground
48
S.N.Bhat, Faculty, Dept. of E&C Engineering, M.I.T Manipal
Stick Diagrams
Contains no dimensions
Represents relative positions of transistors
VDD VDD
Inverter
NAND2
Out Out
In A B
GND GND
49
EE141 Manufacturing
Stick Diagram Drawing : CMOS
Steps
1) Implement the expression in CMOS Logic
2) Find all Euler paths that cover the graph
3) Find n and p Euler paths that have same
labeling
4) Draw Stick diagram for optimization of
diffusion areas
50
EE141 Manufacturing
Stick Diagrams
Logic Graph
A
j C X
B
C
X = C • (A + B)
X i VDD
C
i
B j A
A B
A
B A B C
C
PUN: Pull-up Network, PDN: Pull-down Network
51
EE141 Manufacturing
Two Versions of C • (A + B)
A C B A B C
VDD VDD
X X
GND GND
52
EE141 Manufacturing
Two Stick Layouts of !(C • (A + B))
A C B A B C
VDD VDD
X X
GND GND
X i VDD
B j A
GND A B C
For a single poly strip for every input signal, the Euler
paths in the PUN and PDN must be consistent (the same)
CSE477 L06 Static CMOS Logic.54 Irwin&Vijay, PSU, 2003
OAI22 Logic Graph
X PUN
A C
B D D C
X VDD
X = ((A+B)•(C+D))
C D
B A
A B PDN
A GND
B
C
D
A B D C
VDD
GND
A B
X = AB + CD
C B
VDD
D A
X
GND GND
A B C D
Stick diagram for ordering { A B C D } 57
EE141 Manufacturing
Example: x = ab+cd
x x
b c b c
x VDD x VD D
a d a d
GND GND
VD D
Euler Paths x
For both PUD
GND
and PDN
a b c d
(c) stick diagram for ordering {a b c d}
58
EE141 Manufacturing
Layout of Complex Gate
OUT = (D+E).A+B C
60
EE141 Manufacturing
Minimize area-Eulers path
61
EE141 Manufacturing
Euler graph APPROACH
62
EE141 Manufacturing
63
EE141 Manufacturing
Stick Diagram using Euler Graph Method
64
EE141 Manufacturing
Stick Diagram Optimum Gate Ordering ALL IN ONE
Find a Euler path in both the pull-down tree
graph and the pull-up tree graph with
identical ordering of the inputs.
Euler path: traverses each branch of the
graph exactly once!
By reordering the input gates as E-D-A-B-C,
we can obtain an optimum layout of the
given CMOS gate with single actives for both
NMOS and PMOS devices (below).
65
EE141 Manufacturing
Stick diagram
66
EE141 Manufacturing
Example: 1. Draw Logic Graph
67
EE141 Manufacturing
Example: 2. Define Euler Path
Euler paths are defined
by a path the traverses
each node in the path,
such that each edge is
visited only once.
The path is defined by
the order of each
transistor name. If the
path traverses
transistor A then B then
C. Then the path name
is {A, B, C}
The Euler path of the
Pull up network must be
the same as the path of
the Pull down network.
Euler paths are not
necessarily unique.
It may be necessary to
redefine the function to
find a Euler path.
F = E + (CD) + (AB) =
(AB) +E + (CD)
68
EE141 Manufacturing
Example: 3. Connection label layout
69
EE141 Manufacturing
Example: 4. VDD, VSS and Output Labels
70
EE141 Manufacturing
Example: 5. Interconnected
71
EE141 Manufacturing
1) Z=ABCD
2) Z=A+B+C+D DRAW THE
3) Z=ABC+D STICK
DIAGRAMS
4) Z=(AB+C) D
5) Z=(A+B+C)D
6) Z=A(B+C)+DE
72
EE141 Manufacturing