Professional Documents
Culture Documents
VLSI and ASIC Examples of Physical Layout
VLSI and ASIC Examples of Physical Layout
VLSI and ASIC Examples of Physical Layout
I. I NTRODUCTION
Four questions are answered in this VLSI and ASIC Design
Course Assignment.
1) To draw and simulate the optimized physical level layout
of the logic expression
(A + B) · (B + C)
using "µwind" (MicroWind) as the graphical layout
software tool.
2) To draw and simulate the optimized physical level layout
of a single-bit full-adder for inputs A, B and Cin and
outputs S and Cout .
3) A discussion of commercially available CAD tools
which are used in real time chip designing for logic
Figure 1. OAI implemented CMOS Schematic for Question 1
verification, net-list generation (synthesis tools), logic
level simulators and physical level simulators.
4) A discussion on interconnect routing techniques and
methods in physical layouts. It may be seen from the layout that care has been taken
The sections that follow answer the questions in detail, in to keep the overall size of the layout at a minimum, while
the same order. Some basic level of knowledge in VLSI & also maintaining the mimimum number of contacts (vias) and
ASICs is required to be able to understand them completely[1]. length of the electrical routes as short as possible. The layout
is compliant with the standard design rules, and was subject
II. Q UESTION 1 to DRC checks before finalization.
A. Answer Explanation Table I shows the expected results from the evaluation of
The given expression is: the given expression. Fig. 3. shows the MicroWind simulation
results.
F = (A + B) · (B + C)
This can easily be implemented efficiently using the OAI
(Or-And-Invert) method for implementing CMOS circuits. See B. Conclusion to Question 1
Fig. 1.
Fig. 2. shows the optimized physical layout design. Note The physical layout is as optimized as possible, and the
that the physical layout diagram has been converted into simulation results match the expected results of the given logic
sketchmark patterns for printing clarity. expression.
Figure 3. Simulation Verification for Question 1
Table I
E XPECTED S IMULATION R ESULTS FOR Q UESTION 1
A B C Output
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 0
III. Q UESTION 2
A. Transmission Gate Based Full Adder
A single-bit full-adder can be implemented using the equa-
tions:
S = A ⊕ B ⊕ Cin
Cout = (A · B) + (Cin · (A ⊕ B))
Note that the + operator in the expression for Cin can be
replaced by ⊕ without altering the logic of the circuit, as
shown in Table II, our design will become far simpler because
we now have to construct only two types of gates: XOR &
AND. Cout = (A·B)⊕(Cin ·(A⊕B)). These can be replicated
Figure 2. CMOS Physical Layout Schematic for Question 1 in cells. See Fig. 4.
However, using this approach increases the number of
gates involved. As the assignment question explicitly asks for
Table II
E XPECTED R ESULTS AND E QUATION O UTPUT FOR Q UESTION 2
Cout =
Cin B A S = A ⊕ B ⊕ Cin
(A·B)⊕(Cin ·(A⊕B))
0 0 0 0 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 1 0
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1
optimized layouts, the least size solution demands that the use
of the OR gate be maintained.
For the XOR gates, a particularly compact configuration
utilizing transmission gates (TG) may be used. Fig. 5. shows
such a XOR gate. A full adder implemented using this is the Figure 7. Basic / Unmanipulated Mirror Adder
TG XOR gated adder. A TG XOR gated adder can be imple-
mented in a minimum of 26 transistors. This is less transistors
than the standard OR & AND full adder implementation. ration is actually more than that used in the TG XOR gated
Finally, there is another TG based full adder that uses just 24 adder, while still less than the standard OR & AND full adder.
transistors, as shown in Fig. 6, however the routing complexity However, the basic mirror adder, as shown in Fig. 7. uses
is high. the expressions below[2]: