combinational logic II - COMPLEX CMOS LOGIC GATES Z =...

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon
COMPLEX CMOS LOGIC GATES
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Z = (A(D+E) + BC)’
Background image of page 2
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
pMOS pull up network is the dual of nMOS pull down network. Each driver transistor in the pull down network is represented by an edge , and each node is represented by a vertex in the pull down graph . A new vertex is created within each confined area in the pull down graph , and neighboring vertices are connected by Edges which cross each edge in the pull- down graph only once . Pull up graph.
Background image of page 4
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Stick Diagram layout (arbitrary ordering)
Background image of page 6
Separation between polysilicon columns must allow for one diffusion separation and two metal-to diffusion contacts in between. Extra silicon area. Minimize the number of diffusion breaks for both pMOS and nMOS transistors – separation between polysilicon gate columns can be smaller. Change the ordering of polysilicon. Euler- path approach.
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Euler path in the pull-up network graph with the identical ordering of input labels. Find a common Euler path for both graphs
Background image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 31

combinational logic II - COMPLEX CMOS LOGIC GATES Z =...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online