Professional Documents
Culture Documents
INTRODUCTION
1.1 INTRODUCTION
Wide utilization of memory storage systems and sequential logic in modern
electronics triggers a demand for high-performance and low area implementations of basic
memory components. In these circuits, the output not only depends upon the current values
of the inputs, but also upon preceding input values. These circuits are often called cyclic logic
circuits. These Timing elements (TEs) include latches, flip-flops, registers, and memory
storage cells are one of the most important components in synchronous VLSI designs. Their
performance has a critical effect on cycle time and they often account for a large fraction of
total system power. Therefore, there has been significant interest in the development of fast
and low power TE circuits, and correspondingly in techniques to evaluate their performance.
Previous work in TE characterization [1-5] has failed to consider the effect of circuit loading
on the relative ranking of TE structures. These earlier work used fixed, and usually overly
large, output loads when comparing alternatives. Input drive was either assumed to be large
[3, 5] or was not specified [1, 2, 4, 6, 7]. Bistable circuits exhibit two stable states representing
logic one and logic zero. These include latches and flip flops, which are useful in a number
of applications that require the temporary retention of one or more bits. Some examples are
counters, shift registers, and memories. Bistable circuits can also perform signal shaping
functions, e.g., the Schmitt trigger, which exhibits hysteresis and is useful in this regard. The
two requirements for realization of bistable operation are amplification (gain greater than
unity) and positive feedback. A circuit meeting these requirements can be built using two
cross-coupled inverters, as shown in Fig. 1. There are two stable states for this circuit: state 0 is
characterized by Q = 0 and Q' = 1 and state 1 is characterized by Q = 1 and Q' =0 Either
state is stable and will be maintained as long as the system power is on; therefore, this circuit
can retain 1 bit of information. T or toggle flip flop which is often used for counters can be
realized by connecting the J and K inputs of JK flip flop together. All of the popular flip flop
can easily be modified to incorporate asynchronous set and/or reset inputs. For master-slave
inputs, this normally means adding some extra circuitry to both the master and the slave latch
so that the asynchronous inputs will dominate independent of the clock and other inputs.
1
These inputs are often used to initialize the state of digital ICs at the time the power is first
applied. Normally, a set or reset input is required, but seldom both. A T flip flop alternately
sends an output signal to two different outputs when an input signal is applied.
T-FLIP FLOP:
T Q(t+1)
No change 0 Q(t)
Toggle 1 Q'(t)
2
TABLE 1: THE CHARACTERISTIC TABLE FOR A TOGGLE OR
(i). System specification: The specifications of the system to be designed are exactly
specified in this step. It considers performance, functionality, and the physical dimensions of the
design. The choice of fabrication technology and design techniques is also considered. The end
results are specifications for the size, speed, power, and functionality of the VLSI system to be
designed.
3
(ii) Functional design: In this step, behavioral aspects of the system are considered. The
outcome is usually a timing diagram or other relationships between sub-units. This information is
used to improve the overall design process and to reduce the complexity of the subsequent
phases.
(iii) Logic design: In this step, the functional design is converted into a logical design, using
the Boolean expressions. These expressions are minimized to achieve the smallest logic design
which conforms to the functional design. This logic design of the system is simulated and tested
to verify its correctness.
(iv) Circuit design: This step involves conversion of Boolean expressions into a circuit
representation by taking into consideration the speed and power requirements of the original
design. The electrical behavior of the various components is also considered in this phase. The
circuit design is usually expressed in a detailed circuit diagram.
(v) Physical design: In this step, the circuit representation of each component is converted
into a geometric representation. This representation is a set of geometric patterns which perform
the intended logic function of the corresponding component. Connections between different
components are also expressed as geometric patterns. (This geometric representation of a circuit
is called a layout). The exact details of the layout also depend on design rules, which are
guidelines based on the limitations of the fabrication process and the electrical properties of the
fabrication materials. Physical design is a very complex process; therefore, it is usually broken
down into various sub-steps in order to handle the complexity of the problem.
(vi) Design verification: In this step, the layout is verified to ensure that the layout meets the
system specifications and the fabrication requirements. Design verification consists of design
rule checking (DRC) and circuit extraction. DRC is a process which verifies that all geometric
patterns meet the design rules imposed by the fabrication process. After checking the layout for
design rule violations and removing them, the functionality of the layout is verified by circuit
extraction. This is a reverse engineering process and generates the circuit representation from the
layout. This reverse engineered circuit representation can then be compared to the original circuit
representation to verify the correctness of the layout
(vii) Fabrication: This step is followed after the design verification. The fabrication process
consists of several steps like, preparation of wafer, deposition, and diffusion of various materials
4
on the wafer according to the layout description. A typical wafer is 10 cm in diameter and can be
used to produce between 12 and 30 chips. Before the chip is mass produced, a prototype is made
and tested.
(viii) Packaging, testing, and debugging: In this step, the chip is fabricated and diced in
a fabrication facility. Each chip is then packaged and tested to ensure that it meets all the design
specifications and that it functions properly. Chips used in printed circuit boards (PCBs) are
packaged in a dual in-line package (DIP) or pin grid array (PGA). Chips which are to be used in
a multichip module (MCM) are not packaged because MCMs use bare or naked chips.
5
After a chip has been partitioned, each of the sub-circuits must be placed on a fixed plane and the
nets between all the partitions must be interconnected. The placement of the sub-circuits is done
by the placement algorithms and the nets are routed by using routing algorithms.
(b) Placement: It is the process of arranging a set of modules on the layout surface. Each
module has fixed shape and fixed terminal locations. A poor placement uses larger area and
hence results in performance degradation.
The placement process determines the exact positions of the blocks on the chip, so as to find a
minimum area arrangement for the blocks that allows completion of interconnections between
the blocks. Placement is typically done in two phases. In the first phase an initial placement is
created. In the second phase the initial placement is evaluated and iterative improvements are
made until the layout has minimum area and conforms to design specifications.
It is important to note that some space between the blocks is intentionally left empty to allow
interconnections between blocks. Placement may lead to un-routable design, i.e., routing may not
be possible in the space provided. Thus, another iteration of placement is necessary. To limit the
number of iterations of the placement algorithm, an estimate of the required routing space is used
during the placement phase. A good routing and circuit performance heavily depend on a good
placement algorithm. This is due to the fact that once the position of each block is fixed, very
little can be done to improve the routing and the overall circuit performance.
There are various types of placements.
System-level placement: Place all the PCBs together such that Area occupied is minimum
and Heat dissipation is within limits.
Board-level placement: All the chips have to be placed on a PCB. Area is fixed all modules
of rectangular shape.
The objective is to, minimize the number of routing layers and Meet system performance
requirements.
Chip-level placement: Normally, floor planning / placement carried out along with pin
assignment. It has limited number of routing layers (2 to 4). Bad placements may be unroutable.
Can be detected only later (during routing). Costly delays in design cycle. Minimization of area.
6
Floor planning:
Floor-plan design is an important step in physical design of VLSI circuits to plan the positions of
a set of circuit modules on a chip in order to optimize the circuit performance.
In floor-planning, the information of a set of modules, including their areas and interconnection
is considered and the goal is to plan their positions on a chip to minimize the total chip area and
interconnect cost.
In the floor planning phase, the macro cells are positioned on the layout surface in such a way
that no blocks overlap and that there is enough space left to complete the interconnections. The
input for the floor planning is a set of modules, a list of terminals (pins for interconnections) for
each module and a net list, which describes the terminals which have to be connected.
(c) Routing: The main objective in this step is to complete the interconnections between
blocks according to the specified net list. First, the space not occupied by the blocks (called the
routing space) is partitioned into rectangular regions called channels and switchboxes. The goal
of a router is to complete all circuit connections using the shortest possible wire length and using
only the channels and switchboxes. This is usually done in two phases, referred to as the global
routing and detailed routing phases.
In global routing, connections are completed between the proper blocks of the circuit
disregarding the exact geometric details of each wire and pin. For each wire, the global router
7
finds a list of channels which are to be used as a passage way for that wire. In other words,
global routing specifies the loose route of a wire through different regions in the routing
space. Global routing is followed by detailed routing, which completes point-to-point
connections between pins on the blocks. Loose routing is converted into exact routing by
specifying geometric information such as width of wires and their layer assignments. Detailed
routing includes channel routing and switchbox routing.
As all problems in routing are computationally hard, the researchers have focused on heuristic
algorithms. As a result, experimental evaluation has become an integral part of all algorithms and
several benchmarks have been standardized. Due to the nature of the routing algorithms,
complete routing of all the connections cannot be guaranteed in many cases
(d) Compaction: The operation of layout area minimization without violating the design rules
and without altering the original functionality of layout is called as compaction. The input of
compaction is layout and output is also layout but by minimizing area.
Compaction is done by three ways:
(i) By reducing space between blocks without violating design space rule.
(ii) By reducing size of each block without violating design size rule.
(iii).By reducing shape of blocks without violating electrical characteristics of blocks.
Therefore compaction is very complex process because this process requires the knowledge of
all design rules. Due to the use of strategies compaction algorithms are divided into one-
dimensional algorithms (either in x-dimension or y-dimension), two dimensional algorithms
(both in x-dimension and y-dimension) and topological algorithm (moving of separate cells
according to routing constraints).
8
1.7 SIMULATION
The objective behind any simulation tool is to create a computer based model for the
design verification and analyzing the behavior of circuits under construction also checking the
current level of abstraction.
Types of Simulation:
Device level simulation, Circuit level simulation, Timing level & Macro level
simulation, Switch level simulation, Gate level simulation, RTL simulation, System level
simulation.
Device level simulation:
This model involves with a semiconductor device like a MOS transistor used to test the
effect of fabrication parameters .Simulator techniques based on finite-element method are used
for this purpose.
Circuit level simulation:
It deals with small groups of transistors modeled in the analog domain .The variables
computed are currents and voltages and the computations are based on numerical methods.
Switch level simulation:
This simulation method, models the MOS transistors as switches, that pass signals .The
values of signals are discrete, but it also includes certain analog features to combine certain
components like resistance and capacitance.
Gate level simulation:
In this model a circuit is composed of several logic gates connected by uni-directional
memory less wires. The logic gates themselves are collections of transistors and other circuit
elements which perform a logic function. A logic gate may be a simple inverter or NAND gate or
NOR gate or more complex functional unit like a flip-flop or register.
Register Transfer Level (RTL) simulation:
This model is used synchronous circuits where all registers are controlled by a system
clock signal. The registers store the state of the system, while the combinational logic computes
the next state and the output based on the current state and the input. Here the important
consideration is the state transitions and the precise timing of intermediate signals in the
computation of the next state is not considered.
9
System level Simulation:
It deals with the hardware described in terms of primitives that need not correspond with
hardware building blocks. VHDL is the most popular hardware description language used for
system level simulation. When used in the initial stages of a design, it can describe the behavior
of a circuit as a processor as a set of communicating processes.
1.8 OVERVIEW
This project proposes of a low-power high-speed T flip flop Using GDI Technique.
This novel technique proposes a new method for designing logical circuits in standard
technologies of CMOS. Performance comparison with traditional CMOS and various
transistors logic design techniques. The different methods are compared with respect to
layout area, number of devices, delay, and power dissipation.
1.9 OUTLINE
In the chapter 2 there is a brief explanation of GATE DIFFUSION INPUT TECHNIQUE, and its
operational analysis.
In the chapter 3, there is a brief explanation about software used for the project i.e. MENTOR
GRAPHICS, and tool used is PYXIS.
In chapters 4 & 5th the stimulation results of both CMOS and GDI are shown detailed.
In chapter 6th comparison results and power dissipation of both CMOS and GDI are shown.
1.10 CONCLUSION
In this project we proposed a GDI T flip flop for low-power design was presented. The
proposed circuit has a simple structure, based on two Master-Slave principles, and some gates to
describe T flip flop. It contains 24 transistors. An optimization procedure was developed for GDI
TFF, based on iterative transistor sizing, while targeting a minimal power-delay product.
Performance comparison with other TFF design techniques was shown, with respect to gate area,
delay and power dissipation.
10
CHAPTER 2
LOW POWER HIGH SPEED T-FLIP FLOP USING GATE
DIFFUSION INPUT TECHNIQUE
11
AND, OR, XOR, MUX, etc). As the allotment of supply and ground to PMOS and NMOS is not
fixed in case of GDI, therefore, problem of low voltage swing arises in case of GDI which is a
drawback and hence finds difficulty in case of implementation of analog circuits.
The most common problem with PTL technique is its low voltage swing. An extra buffer
circuitry may be used additionally to eliminate the problem of low swing and improve
drivability. The problem of low swing can be understood with the help of a random function
shown in figure and table.
The problem of low swing occurs only when A=0 and B=0 where the voltage level is VTP
instead of 0.This occurs due to the poor high to low transition characteristics of PMOS. In the
rest of the cases it provides full swing.
12
f(x1, x2, ..., xn) = x1f(1, x2, ..., xn) + x1'f(0, x2, ..., xn)
On the right side, the function is the sum of two terms, one of them relevant when x1 is equal to 1
and the other when x1 is equal to 0 . The first term is x1 times what remains of f when x1 is equal
to the value 1 and the second term is x1' times what remains of f when x1 is equal to 0.
Shannons expansion theorem in the general case is
f = a0 x1'x2' ... xn' + a1x1'x2' ... xn1'xn + a2x1'x2' ... xn1 xn' + ...+ a2n2 x1x2... xn' + a2n1 x1x2... xn
Each ai is a constant in which the subscript is the decimal equivalent of the multiplier of
ai viewed as a binary number. Thus, for three variables, a5 (binary 101) is the coefficient of
x1x2'x3.
In a similar way it can be stated as any switching function of n variables can be expressed as a
product of sums of n literals, one for each variable .
The concept of Shannon theorem could be applied with ease to design a basic GDI cell. In
Shannon expansion theorem, any function F can be written as: F(x1xn) = x1H(x2.xn) + (not
x1)G(x2xn) = x1F(1,x2xn)+(notx1)F(0,x2.xn) (1) That is a larger function can be broken
down into smaller function as shown above in equation (1). Then, the smaller functions could be
further broken down if possible till the time it is not further reducible. The output function of a
basic GDI cell (where A, B, and C are inputs to G, P, and N, respectively) is given by: Out=AC +
(notA) B (2) Therefore, comparing equations (1) and (2) it is seen that a standard GDI cell can be
used to implement any logic function based on Shannon expansion theorem as shown below
taking an example. If A=x1, C=F(1,x1.xn), B=F(0,x1..xn) then Out=F(x1xn)=x1F(1,x2
xn) +( not x1) F(0,x2xn).
13
Figure 2.1: a T flip flop based on cross-coupled NOR gates.
T Q(t+1)
No Change 0 Q(t)
Toggle 1 Q'(t)
14
N P G D Function
'0' B A HB F1
B '1' A H+B F2
'1' B A A+B OR
B '0' A AB AND
C B A HB+AC MUX
'0' '1' A H NOT
TABLE 2.3: SOME LOGIC FUNCTIONS THAT CAN BE IMPLENTED WITH A SINGLE
GDI CELL.
15
Figure 2.3: GDI T-flip flop implementation
Average Power: Best results of average power are observed for the dynamic GDI ~ 77 %
(approximately) less than the modified CMOS implementation and 84% less than the TGB
circuit (which is the best CMOS implementation in terms of power). GDI T-flip flop shows
results close to the CMOS circuit, and better than any static CMOS implementation.
1) Maximal Delay: The Dynamic GDI is the fastest circuit, showing up to 44% decrease compared
to modified CMOS techniques, and a 76% improvement compared to the TGB, which is the
16
fastest technique among CMOS circuits.
2) Power delay product: GDI T flip flop circuit has 87% decrease PDP compared to modified
CMOS technique and 96% less than TGB circuit.
It should be noted that the optimization in all compared circuits is performance-driven
(minimal power-delay product is obtained by sizing), while separate parameters, like average
power and maximal delay are secondary. The Simulation results diagram obtained through can
be seen in Fig. For Average power and PDP used.
(a) (b)
Figure 2.5: Set of representative flip -flops for comparison: (a) modified CMOS, (b) tgb
17
(a) (b)
(c) (d)
Figure 2.6: timing diagram of a) input clock, b) square input wave, c) output of T flip flop (Q) and d)
differential output (Q')
(a) (b)
18
CHAPTER 3
TOOLS USED
3.1 Mentor graphics history
In 1981, the idea of computer-aided design for electronics as the foundation of a company
occurred to several groups - those who founded Mentor, Valid Logic Systems, and Daisy
Systems. One of the main distinctions between these groups was that the founding engineers of
Mentor, whose backgrounds were in software development at Tektronix, ruled out designing and
manufacturing proprietary computers to run their software applications. They felt that hardware
was going to become a commodity owned by big computer companies, so instead they would
select an existing computer system as the hardware platform for the Computer Aided
Engineering (CAE) programs they would build.
By February 1981, most of the start-up team had been identified; by March, the three executive
founders, Tom Bruggere, Gerry Langeler and Dave Moffenbeier had left Tektronix, and by May
the business plan was complete. The first round of money, $1 million, came from Sutter Hill,
Greylock, and Venrock Associates. The next round was $2 million from five venture capital
firms and in April 1983 a third round raised $7 million more. Mentor Graphics was one of the
first companies to attract venture capital to Oregon. Apollo Computer workstations were chosen
as the initial hardware platform. Based in Chelmsford, Apollo was less than a year old and had
only announced itself to the public a few weeks prior to when the founders of Mentor Graphics
began their initial meetings.
When Mentor entered the CAE market the company had two technical differentiators: the first
was the software - Mentor, Valid, and Daisy each had software with different strengths and
weaknesses. The second was the hardware - Mentor ran all programs on the Apollo workstation,
while Daisy and Valid each built their own hardware. By the late 1980s, all EDA companies
abandoned proprietary hardware in favor of workstations manufactured by companies such as
Apollo and Sun Microsystems. After a frenzied development, the IDEA 1000 product was
introduced at the 1982 Design Automation Conference, though in a suite and not on the floor. By
19
the time founder Bruggere ran for the U.S. Senate in 1996, the company had grown to annual
revenues of $384 million.
Mentor Graphics is a global company with product development taking place in the USA,
Europe, Japan, Pakistan, India and Egypt. In keeping with global trends in software
development, the company has a substantial labor force in lower cost locations such as Pakistan,
India, Poland, Hungary and Egypt. James "Jim" Ready, one of the more colorful people
in embedded systems, left Mentor in 1999 to form the embedded Linux company MontaVista.
Neil Henderson, a pioneer in the royalty-free, source provided market space, joined Mentor
Graphics in 2002 with the acquisition of Accelerated Technology Inc. Stephen Mellor, a leader in
the UML space and co-originator of the Shlaer-Mellordesign methodology, joined Mentor
Graphics in 2004 following the acquisition of Project Technology. As of 2012, Mentor's major
competitors are: Cadence Design Systems, Synopsys and Zuken.
In June 2008, Cadence Design Systems offered to acquire Mentor Graphics in a leveraged
buyout. On 15 August 2008, Cadence withdrew this offer quoting an inability to raise the
necessary capital and the unwillingness of Mentor Graphics' Board and management to discuss
the offer. Mentor acquired Flomerics Group plc for $60 million in cash in October 2008, and in
August 2009, Mentor completed the acquisition of silicon manufacturing testing
company LogicVision for $13 million in an all stock deal.[8] Mentor completed the acquisition of
Valor Computerized Systems in March 2010 in a cash and stock deal valued at $50 million.
On 22 February 2011, Carl Icahn, an activist investor, made an offer to buy the company for
about $1.86 billion in cash in a move to push other suitors to declare themselves.
20
IC place and route tool: Olympus-SoC
21
natively supports System Verilog for Test bench, UPF, UCIS, OVM/UVM where
ModelSim does not.
Pyxis Layout, part of Mentor's new Pyxis Custom IC Design Platform, provides a fast and
flexible environment for layout entry and editing.
Pyxis Layout supports an extensive set of editing functions for efficient, accurate polygon
editing. This gives the design engineer full control of circuit density and performance, while
improving productivity by as much as 5X. Hierarchy and advanced window management allows
multiple views of the same cell and provides the capability to edit both views. Additionally,
design engineers can create matched analog layouts quickly by editing using a half-cell
methodology.
Pyxis Layout interacts seamlessly with other solutions in the Pyxis Custom IC Design Platform
to create, develop, simulate, verify, optimize and implement even the most challenging full
custom analog and mixed-signal IC designs quickly and accuratelythe first time. As a designer,
you enjoy a consistent look and feel in single environment, whether creating schematics, block
diagrams, symbols, or HDL representations. Additionally, Mentors foundry partners provide
certified design kits for use with Pyxis Custom IC Design Platform solutions.
22
Schematic Driven Layout
Any mix of polygons, device generators (either custom, built-in or from a foundry supplied
Process Design Kit), and cell data are supported in the layout environment. Available as an add-
on option to Pyxis Layout, Pyxis SDL enables this functionality, reducing design cycle time and
assuring correct-by-construction layout.
Concurrent Editing
Pyxis Concurrent, an add-on option for Pyxis Layout, allows multiple designers to
simultaneously make edits to the same cell. With Pyxis Concurrent, multiple designers can join a
layout session in shared mode. Once in the session, the designers create fences to define their
work area. They can create one or more fences and can make edits to any shape or path that is
wholly enclosed within their fenced area. These shapes are local to the session and are not stored
with the design.
KEY BENEFITS
Reduces design rule checking (DRC) debugging cycles, leading to shortened time-to-market.
23
Creates DRC/LVScorrect complex layout with a simple command to improve reliability of final
product.
Options
24
Fig.3.2 Pyxis Tool Set
25
Design Framework II (DFII) -Composer (Cadence)
Current MOSIS Instructional: IBM 180nm CMOS (7RF), ON Semi 0.5um CMOS
Current MOSIS Unfunded Research: IBM 130nm CMOS (8RF), 130nm SiGEBiCMOS(8HP)
26
3.7 CALIBRE RVE
While the Calibre platforms best-in-class engines provide physical and circuit
verification results in record time, you still need to fix the identified layout issues before you can
tape out.
Calibre RVE provides fast, flexible, and easy-to-use graphical debugging capabilities that
minimize your turnaround time and get you to tapeout-clean on schedule. Calibre RVE is
27
integrated into all the popular layout environments, including Mentor Graphics IC Station,
Calibre DESIGNrev, Synopsys IC Compiler, Cadence Encounter, Cadence Virtuoso, Springsoft
Laker, Seiko, Tanner, and Agilent ADS. Whatever design environment you use, Calibre RVE
provides the debugging technology you need for fast, accurate error resolution.
While the Calibre platforms best-in-class engines provide physical and circuit verification results in
record time, you still need to fix the identified layout issues before you can tape out. Calibre RVE
provides fast, flexible, and easy-to-use graphical debugging capabilities that minimize your turnaround
time and get you to tapeout-clean on schedule. Calibre RVE is integrated into all the popular layout
environments, including Mentor Graphics IC Station, Calibre DESIGNrev, Synopsys IC Compiler,
Cadence Encounter, Cadence Virtuoso, Springsoft Laker, Seiko, Tanner, and Agilent ADS. Whatever
design environment you use, Calibre RVE provides the debugging technology you need for fast,
accurate error resolution.
While the Calibre platforms best-in-class engines provide physical and circuit
verification results in record time, you still need to fix the identified layout issues before you can
tape out. Calibre RVE provides fast, flexible, and easy-to-use graphical debugging capabilities
that minimize your turnaround time and get you to tapeout-clean on schedule. Calibre RVE is
integrated into all the popular layout environments, including Mentor Graphics IC Station,
Calibre DESIGNrev, Synopsys IC Compiler, Cadence Encounter, Cadence Virtuoso, Springsoft
Laker, Seiko, Tanner, and Agilent ADS. Whatever design environment you use, Calibre RVE
provides the debugging technology you need for fast, accurate error resolution.
While the Calibre platforms best-in-class engines provide physical and circuit
verification results in record time, you still need to fix the identified layout issues before you can
tape out. Calibre RVE provides fast, flexible, and easy-to-use graphical debugging capabilities
that minimize your turnaround time and get you to tapeout-clean on schedule. Calibre RVE is
integrated into all the popular layout environments, including Mentor Graphics IC Station,
Calibre DESIGNrev, Synopsys IC Compiler, Cadence Encounter, Cadence Virtuoso, Springsoft
Laker, Seiko, Tanner, and Agilent ADS. Whatever design environment you use, Calibre RVE
provides the debugging technology you need for fast, accurate error resolution.
28
PHYSICAL VERIFICATION
However complex the rule deck, Calibre RVE can handle it. Even with millions of error
results, Calibre RVE provides fast navigation through the layout, allowing you to focus on
analyzing and fixing the errors. The tabbed viewing format enables you to easily organize data
by tiling the display windows side by side. And, because Calibre RVE is designed with a low-
memory footprint, you can run it on the same machine you use for your design environment.
Waived errors can be a source of needless work and lost time. Calibre RVE provides a flexible
waiver flow to persistently mark, annotate, and review error results that will be waived by the
foundry. Calibre RVE also provides integrated support for the Calibre Auto-Waiver flow and
automatically removes waivers from the results, reducing your turnaround time even further.
CALIBRE RVE:
Filters error results by cell, check, property, waived, and fixed status so you can quickly
Highlights DRC results in the context in which they occur, providing greater flexibility
Enables designers to merge generated polygons (such as metal fill) into the original
layout database.
Circuit Verification
Calibre RVE has kept pace with the expanding requirements of circuit verification with a
wide range of capabilities, including: layout vs. schematic (LVS), schematic vs. schematic
(SVS), electrical rule checking (ERC), programmable electrical rule checking (PERC), soft
checks, point-to-point resistance checking, and current density checking. By providing both
29
source and layout schematics, Calibre RVE can easily and quickly cross-highlight between the
schematics, the design layout, and the Calibre LVS results report
Fast and intuitive schematic visualization and hierarchical SPICE browser to navigate and
highlight nets and devices. Highlights appear in layout and schematic windows, along with the
Calibre RVE layout and source schematics.
Fix suggestions that provide an English description of the error (e.g., Layout net 5 and 10 are
shorted) to simplify and speed up the debugging process.
Advanced Short Isolation function that can be run hierarchically and by layer to quickly isolate
the root cause of a texted short.
When the short isolation algorithm is unable to pinpoint the short, the Calibre RVE interface
enables the user to interactively isolate the issue without re-running the batch tool.
30
3.8 DRC
Design Rules are a series of parameters provided by semiconductor manufacturers that enable the
designer to verify the correctness of a mask set. Design rules are specific to a particular semiconductor
manufacturing process. A design rule set specifies certain geometric and connectivity restrictions to
ensure sufficient margins to account for variability in semiconductor manufacturing processes, so as to
ensure that most of the parts work correctly.
31
do not validate that the design will operate correctly, they are constructed to verify that the structure
meets the process constraints for a given design type and process technology.
Poly density
Antenna effect
Advanced Design System Design Rule Checker by Agilent's EEsof EDA division
32
3.9 LVS
Calibre nmLVS, the market-leading layout vs. schematic physical verification tool, is tightly
linked with both Calibre nmDRC and Calibre xRC to deliver production-proven device
extraction for both physical verification and parasitic extraction. Calibre nmLVS performs a vital
function as a member of a complete IC verification tool suite by providing device and
connectivity comparisons between the IC layout and the schematic. Calibre's hierarchical
processing engine runs Calibre nmLVS, supplying data for modifying the IC design to achieve
superior functionality and reliability.
Calibre nmLVS enables accurate circuit verification because it is able to measure actual
device geometries on a full-chip for a complete accounting of physical parameters. These precise
device parameters supply the information for back-annotation to the source schematic and the
comprehensive data for running simulations. In addition to working with Calibre xRC, Calibre
nmLVS can also be used with third party parasitic extraction tools.
Calibre nmLVS can now be enhanced with Calibre PERC (Programmable Electrical
Rule Checker). With Calibre PERC, you can automate advanced, customer-specific ERCs to
eliminate lengthy and error-prone manual checking. PERC recognizes grouped devices that are
connected as you describe and measures geometrical data associated with the circuit topology.
33
AUTOMATE ADVANCED, CUSTOMER-SPECIFIC ERCS
Calibre nmLVS can now be enhanced with Calibre PERC (Programmable Electrical
Rule Checker). With Calibre PERC, you can automate advanced, customer-specific ERCs to
eliminate lengthy and error-prone manual checking. PERC recognizes grouped devices that are
connected as you describe and measures geometrical data associated with the circuit topology.
Red Hat Enterprise Linux (RHEL) is a Linux distribution developed by Red Hat and
targeted toward the commercial market. Red Hat Enterprise Linux is released in server versions
for x86, x86-64, Itanium, PowerPC and IBM System z, and desktop versions for x86 and x86-64.
All of the Red Hat's official support and training, together with the Red Hat Certification
Program, focuses on the Red Hat Enterprise Linux platform. Red Hat Enterprise Linux is often
abbreviated to RHEL, although this is not an official designation.
The first version of Red Hat Enterprise Linux to bear the name originally came onto the market
as "Red Hat Linux Advanced Server". In 2003 Red Hat rebranded Red Hat Linux Advanced
Server to "Red Hat Enterprise Linux AS", and added two more variants, Red Hat Enterprise
Linux ES and Red Hat Enterprise Linux WS.
Red Hat uses strict trademark rules to restrict free re-distribution of their officially supported
versions of Red Hat Enterprise Linux, but still freely provides its source code. Third-party
derivatives can be built and redistributed by stripping away non-free components like Red Hat's
trademarks, including community-supported distributions like CentOS and Scientific Linux, and
commercial forks like Oracle Linux, which aim to offer 100% binary compatibility with Red Hat
Enterprise Linux.
3.11 VARIANTS
34
There are also "Academic" editions of the Desktop and Server variants. They are offered
to schools and students, are less expensive, and are provided with Red Hat technical support as
an optional extra. Web support based on number of customer contacts can be purchased
separately.
It is often assumed the branding ES, AS, and WS stand for "Entry-level Server", "Advanced
Server" and "Work Station", respectively. The reason for this is that the ES product is indeed the
company's base enterprise server product, while AS is the more advanced product. However,
nowhere on its site or in its literature does Red Hat say what AS, ES and WS stand for. In Red
Hat Enterprise Linux 5 there are new editions that substitute former Red Hat Enterprise Linux
AS/ES/WS/Desktop:
Red Hat Enterprise Linux Desktop with Workstation and Multi-OS option
Red Hat Enterprise Linux Desktop with Workstation option (former WS)
Red Hat had also announced its Red Hat Global Desktop Linux edition "for emerging markets".
Red Hat Enterprise Linux WS for technical power user enterprise desktops for high-
performance computing
35
Red Hat Desktop for multiple deployments of single-user desktops for enterprises
CHAPTER 4
IMPLEMENTATION OF T-FLIP FLOP USING CMOS
36
Fig 4.1 Transistor level of CMOS T-flip flop
37
Fig 4.2 CMOS T-flip flop cell symbol
38
Fig 4.4 CMOS T-flip flop waveforms
39
4.1 DRC REPORT FOR CMOS T-FLIP FLOP
==========================================================================
========
=== CALIBRE::DRC-H SUMMARY REPORT
===
Execution Date/Time: Tue Feb 24 19:59:41 2015
Calibre Version: v2012.4_25.21 Tue Dec 11 17:18:50 PST 2012
Rule File Pathname:
/mgc_tree/tnssprproject/cmostff/lib/cell/newlay.cal/_DRC_
Rule File Title:
Layout System: GDS
Layout Path(s): newlay.calibre.db
Layout Primary Cell: newlay
Current Directory:
/mgc_tree/tnssprproject/cmostff/lib/cell/newlay.cal
User Name: root
Maximum Results/RuleCheck: 1000
Maximum Result Vertices: 4096
DRC Results Database: newlay.drc.results (ASCII)
Layout Depth: ALL
Text Depth: PRIMARY
Summary Report File: newlay.drc.summary (REPLACE)
Geometry Flagging: ACUTE = YES SKEW = YES ANGLED = NO OFFGRID =
YES
NONSIMPLE POLYGON = YES NONSIMPLE PATH = NO
Excluded Cells:
CheckText Mapping: ALL TEXT
Layers: MEMORY-BASED
Keep Empty Checks: YES
--- RULECHECK RESULTS STATISTICS (BY CELL)
---
CELL newlay ............ TOTAL Result Count = 1 (1)
RULECHECK PO.R.2 ... TOTAL Result Count = 1 (1)
--------------------------------------------------------------------------
--------
--- SUMMARY
---
TOTAL CPU Time: 0
TOTAL REAL Time: 0
TOTAL Original Layer Geometries: 1692 (1692)
TOTAL DRC RuleChecks Executed: 386
TOTAL DRC Results Generated: 1 (1)
40
4.2 LVS REPORT FOR CMOS T-FLIP FLOP
##################################################
## ##
## C A L I B R E S Y S T E M ##
## ##
## L V S R E P O R T ##
## ##
##################################################
# ################### _ _
# # # * *
# # # CORRECT # |
# # # # \___/
# ###################
**************************************************************************
************************************
CELL SUMMARY
**************************************************************************
************************************
41
**************************************************************************
************************************
LVS PARAMETERS
**************************************************************************
************************************
o LVS Setup:
42
LVS SPICE SCALE X PARAMETERS NO
LVS SPICE STRICT WL NO
// LVS SPICE OPTION
LVS STRICT SUBTYPES NO
LVS EXACT SUBTYPES NO
LAYOUT CASE NO
SOURCE CASE NO
LVS COMPARE CASE NO
// Reduction
// Trace Property
43
TRACE PROPERTY r(rndiffwo) l l 0
TRACE PROPERTY r(rpdiffwo) w w 0
TRACE PROPERTY r(rpdiffwo) l l 0
TRACE PROPERTY r(rnwod) w w 0
TRACE PROPERTY r(rnwod) l l 0
TRACE PROPERTY r(rnwsti) w w 0
TRACE PROPERTY r(rnwsti) l l 0
TRACE PROPERTY r(rnpolylo) w w 0
TRACE PROPERTY r(rnpolylo) l l 0
TRACE PROPERTY r(rppolylo) w w 0
TRACE PROPERTY r(rppolylo) l l 0
TRACE PROPERTY r(rnpolyhi) w w 0
TRACE PROPERTY r(rnpolyhi) l l 0
TRACE PROPERTY r(rppolyhi) w w 0
TRACE PROPERTY r(rppolyhi) l l 0
TRACE PROPERTY mn(nmos) l l 0
44
TRACE PROPERTY spiral_inductor_lvs nr nr 0
# ################### _ _
# # # * *
# # # CORRECT # |
# # # # \___/
# ###################
--------------------------------------------------------------------------
------------------------------------
--------------------------
Nets: 27 27
Instances: 23 23 MN (4 pins)
23 23 MP (4 pins)
------ ------
Total Inst: 46 46
Nets: 17 17
Instances: 2 2 MP (4 pins)
2 2 SPMN_2_1 (5 pins)
5 5 _invv (4 pins)
2 2 _nand2v (5 pins)
45
4 4 _nor2v (5 pins)
2 2 _smp2v (4 pins)
------ ------
Total Inst: 17 17
**************************************************************************
************************************
INFORMATION AND WARNINGS
**************************************************************************
************************************
Nets: 17 17 0 0
Instances: 2 2 0 0 MP(PMOS)
2 2 0 0 SPMN_2_1
5 5 0 0 _invv
2 2 0 0 _nand2v
4 4 0 0 _nor2v
2 2 0 0 _smp2v
Total Inst: 17 17 0 0
**************************************************************************
************************************
SUMMARY
**************************************************************************
************************************
46
4.3 PEX NETLIST FOR CMOS T-FLIP FLOP
* File: newlay.pex.netlist
* Created: Tue Feb 24 20:02:25 2015
* Program "Calibre xRC"
* Version "v2012.4_25.21"
*
.global VDD VSS
.include "newlay.pex.netlist.pex"
.subckt newlay GROUND Q QBAR CLK T
*
* T T
* CLK CLK
* QBAR QBAR
* Q Q
* GROUND GROUND
* VDD VDD
M0 N_3_M0_d N_CLK_M0_g N_2_M0_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M1 N_2_M1_d N_Q_M1_g N_GROUND_M1_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M2 N_6_M2_d N_QBAR_M2_g N_5_M2_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M3 N_3_M3_d N_T_M3_g N_2_M3_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M4 N_5_M4_d N_CLK_M4_g N_GROUND_M4_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M5 N_6_M5_d N_T_M5_g N_5_M5_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M6 N_7_M6_d N_6_M6_g N_GROUND_M6_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M7 N_8_M7_d N_7_M7_g N_GROUND_M7_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M8 N_8_M8_d N_13_M8_g N_GROUND_M8_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M9 N_9_M9_d N_CLK_M9_g N_GROUND_M9_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M10 N_10_M10_d N_3_M10_g N_GROUND_M10_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-
06
M11 N_12_M11_d N_8_M11_g N_11_M11_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M12 N_11_M12_d N_9_M12_g N_GROUND_M12_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-
06
M13 N_13_M13_d N_8_M13_g N_GROUND_M13_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-
06
M14 N_14_M14_d N_12_M14_g N_GROUND_M14_s N_GROUND_M0_b NMOS L=1.3e-07
W=2e-06
M15 N_13_M15_d N_10_M15_g N_GROUND_M15_s N_GROUND_M0_b NMOS L=1.3e-07
W=2e-06
M16 N_Q_M16_d N_14_M16_g N_GROUND_M16_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-
06
47
M24 N_20_M24_d N_CLK_M24_g N_VDD_M24_s N_VDD_M23_b PMOS L=1.3e-07 W=2e-06
M25 N_3_M25_d N_Q_M25_g N_VDD_M25_s N_VDD_M23_b PMOS L=1.3e-07 W=2e-06
M26 N_21_M26_d N_QBAR_M26_g N_VDD_M26_s N_VDD_M23_b PMOS L=1.3e-07 W=2e-06
M27 N_6_M27_d N_T_M27_g N_21_M27_s N_VDD_M23_b PMOS L=1.3e-07 W=2e-06
M28 N_6_M28_d N_CLK_M28_g N_VDD_M28_s N_VDD_M23_b PMOS L=1.3e-07 W=2e-06
M29 N_7_M29_d N_6_M29_g N_VDD_M29_s N_VDD_M23_b PMOS L=1.3e-07 W=2e-06
M30 N_22_M30_d N_7_M30_g N_VDD_M30_s N_VDD_M23_b PMOS L=1.3e-07 W=2e-06
M31 N_8_M31_d N_13_M31_g N_22_M31_s N_VDD_M23_b PMOS L=1.3e-07 W=2e-06
M32 N_10_M32_d N_3_M32_g N_VDD_M32_s N_VDD_M32_b PMOS L=1.3e-07 W=2e-06
M33 N_9_M33_d N_CLK_M33_g N_VDD_M33_s N_VDD_M32_b PMOS L=1.3e-07 W=2e-06
M34 N_12_M34_d N_8_M34_g N_VDD_M34_s N_VDD_M23_b PMOS L=1.3e-07 W=2e-06
M35 N_12_M35_d N_9_M35_g N_VDD_M35_s N_VDD_M23_b PMOS L=1.3e-07 W=2e-06
M36 N_23_M36_d N_8_M36_g N_VDD_M36_s N_VDD_M32_b PMOS L=1.3e-07 W=2e-06
M37 N_13_M37_d N_10_M37_g N_23_M37_s N_VDD_M37_b PMOS L=1.3e-07 W=2e-06
M38 N_14_M38_d N_12_M38_g N_VDD_M38_s N_VDD_M23_b PMOS L=1.3e-07 W=2e-06
M39 N_24_M39_d N_14_M39_g N_VDD_M39_s N_VDD_M23_b PMOS L=1.3e-07 W=2e-06
M40 N_Q_M40_d N_QBAR_M40_g N_24_M40_s N_VDD_M40_b PMOS L=1.3e-07 W=2e-06
M41 N_17_M41_d N_9_M41_g N_VDD_M41_s N_VDD_M41_b PMOS L=1.3e-07 W=2e-06
M42 N_17_M42_d N_13_M42_g N_VDD_M42_s N_VDD_M41_b PMOS L=1.3e-07 W=2e-06
M43 N_18_M43_d N_17_M43_g N_VDD_M43_s N_VDD_M41_b PMOS L=1.3e-07 W=2e-06
M44 N_QBAR_M44_d N_18_M44_g N_25_M44_s N_VDD_M41_b PMOS L=1.3e-07 W=2e-06
M45 N_25_M45_d N_Q_M45_g N_VDD_M45_s N_VDD_M41_b PMOS L=1.3e-07 W=2e-06
*
.include "newlay.pex.netlist.NEWLAY.pxi"
*
.ends.
48
4.4 EXTRACTION REPORT FOR CMOS T-FLIP FLOP
#############################################################
## ##
## C A L I B R E S Y S T E M ##
## ##
## C I R C U I T E X T R A C T I O N R E P O R T ##
## ##
#############################################################
WARNING: Invalid PATHCHK request "! POWER && ! GROUND": no GROUND nets
present, operation aborted.
49
4.5 PARASITICS FOR CMOS T-FLIP FLOP
50
// Parsing file
'/mgc_tree/design_data/new_pdk/PDK/generic13/symbols/nmos/@ncf.dir/nmos.nc
f' succeeded.
// NOTE: There is no part interface for the top level schematic. The
external nets in the schematic
// are being scanned to create the pin names for the top level
subckt.
Number of cells: 6
Number of primitive instances: 49
Done...
/mgc_tree/AMS/aol/lib/libeldojfet_64.so
/mgc_tree/AMS/aol/lib/libeldosoi_64.so
/mgc_tree/AMS/aol/lib/libeldomos4_64.so
/mgc_tree/AMS/aol/lib/libeldoasitft_64.so
/mgc_tree/AMS/aol/lib/libeldohisim_64.so
/mgc_tree/AMS/aol/lib/libeldospmod_64.so
/mgc_tree/AMS/aol/lib/libeldopsp_64.so
/mgc_tree/AMS/aol/lib/libeldomosvar_64.so
/mgc_tree/AMS/aol/lib/libeldolegtft_64.so
/mgc_tree/AMS/aol/lib/libeldomoto_64.so
51
/mgc_tree/AMS/aol/lib/libeldost_64.so
/mgc_tree/AMS/aol/lib/libeldobnr_64.so
/mgc_tree/AMS/aol/lib/libeldorockw_64.so
/mgc_tree/AMS/aol/lib/libeldopubhicum_64.so
/mgc_tree/AMS/aol/lib/libeldotftsh_64.so
/mgc_tree/AMS/aol/lib/libeldobta_64.so
/mgc_tree/AMS/aol/lib/libeldofas_64.so
/mgc_tree/AMS/aol/lib/libeldofascm_64.so
/mgc_tree/AMS/aol/lib/libeldosdsim_64.so
/
mgc_tree/AMS/aol/lib/libeldowire_64.so
/mgc_tree/AMS/aol/lib/libogr_64.so loaded.
***** 0 error(s).
***** 0 warning(s).
52
***** GENERATION ...
***** 0 error(s).
***** 0 warning(s).
Eldo VERSION : ELDO 14.1 (64 bits) Fri Jul 4 10:16:17 GMT 2014
Performing DC analysis...
53
X_CELL1.N$63 5.0000
X_CELL1.N$65 723.0446N
X_CELL1.N$69 5.0000
X_CELL1.N$78 435.6477N
X_CELL1.N$89 693.3957M
X_CELL1.N$91 5.0000
................................................
Simulation progress : 20% (t = 121.0000 N)
Elapsed CPU time : 0h 0mn 0s 10 ( 0h 0mn 0s 40)
CPU Usage : 76% ( 45%)
................................................
Simulation progress : 30% (t = 182.2978 N)
Elapsed CPU time : 0h 0mn 0s 10 ( 0h 0mn 0s 60)
CPU Usage : 52% ( 56%)
................................................
Simulation progress : 40% (t = 242.5731 N)
Elapsed CPU time : 0h 0mn 0s 20 ( 0h 0mn 0s 80)
CPU Usage : 100% ( 66%)
................................................
Simulation progress : 50% (t = 300.0000 N)
Elapsed CPU time : 0h 0mn 0s 10 ( 0h 0mn 0s 90)
CPU Usage : 71% ( 66%)
................................................
Simulation progress : 60% (t = 361.4319 N)
Elapsed CPU time : 0h 0mn 0s 20 ( 0h 0mn 0s 110)
CPU Usage : 86% ( 69%)
................................................
Simulation progress : 70% (t = 421.0000 N)
Elapsed CPU time : 0h 0mn 0s 10 ( 0h 0mn 0s 120)
CPU Usage : 76% ( 70%)
................................................
Simulation progress : 80% (t = 482.2978 N)
Elapsed CPU time : 0h 0mn 0s 20 ( 0h 0mn 0s 140)
CPU Usage : 100% ( 76%)
................................................
Simulation progress : 90% (t = 542.5731 N)
Elapsed CPU time : 0h 0mn 0s 0 ( 0h 0mn 0s 140)
54
CPU Usage : 0% ( 74%)
................................................
Simulation progress : 100% (t = 600.0000 N)
Elapsed CPU time : 0h 0mn 0s 10 ( 0h 0mn 0s 150)
CPU Usage : 100% ( 76%)
SIMULATION INFORMATION
memory size allocated in Mbytes 259.9
Latency: 0.000000%
average number of newton iterations: 2.393822
nb of components: 49
nb of nodes: 118
nb of MOS or BIP calls: 7508
Number of steps computed: 259
55
CHAPTER 5
IMPLEMENTATION OF T FLIP FLOP USING GDI
56
Fig: 5.3 GDI T-flip flop schematic cell
57
Fig: 5.5 GDI T-flip flop layout
58
5.1 DRC REPORT FOR GDI T- FLIP FLOP
==========================================================================
========
=== CALIBRE::DRC-H SUMMARY REPORT
===
Execution Date/Time: Thu Feb 19 19:26:57 2015
Calibre Version: v2012.4_25.21 Tue Dec 11 17:18:50 PST 2012
Rule File Pathname: /mgc_tree/rajkiran/tff/L1/C1/l3.cal/_DRC_
Rule File Title:
Layout System: GDS
Layout Path(s): l3.calibre.db
Layout Primary Cell: l3
Current Directory: /mgc_tree/rajkiran/tff/L1/C1/l3.cal
User Name: root
Maximum Results/RuleCheck: 1000
Maximum Result Vertices: 4096
DRC Results Database: l3.drc.results (ASCII)
Layout Depth: ALL
Text Depth: PRIMARY
Summary Report File: l3.drc.summary (REPLACE)
Geometry Flagging: ACUTE = YES SKEW = YES ANGLED = NO OFFGRID =
YES
NONSIMPLE POLYGON = YES NONSIMPLE PATH = NO
Excluded Cells:
CheckText Mapping: ALL TEXT
Layers: MEMORY-BASED
Keep Empty Checks: YES
--------------------------------------------------------------------------
--------
--- RULECHECK RESULTS STATISTICS (BY CELL)
---
CELL l3 ................ TOTAL Result Count = 1 (1)
RULECHECK PO.R.2 ... TOTAL Result Count = 1 (1)
--------------------------------------------------------------------------
--------
--- SUMMARY
---
TOTAL CPU Time: 0
TOTAL REAL Time: 0
TOTAL Original Layer Geometries: 792 (792)
TOTAL DRC RuleChecks Executed: 386
TOTAL DRC Results Generated: 1 (1)
59
5.2 LVS REPORT FOR GDI T-FLIP FLOP
##################################################
## ##
## C A L I B R E S Y S T E M ##
## ##
## L V S R E P O R T ##
## ##
##################################################
# ################### _ _
# # # * *
# # # CORRECT # |
# # # # \___/
# ###################
**************************************************************************
************************************
CELL SUMMARY
**************************************************************************
************************************
60
**************************************************************************
************************************
LVS PARAMETERS
**************************************************************************
************************************
o LVS Setup:
61
LAYOUT CASE NO
SOURCE CASE NO
LVS COMPARE CASE NO
LVS DOWNCASE DEVICE NO
LVS REPORT MAXIMUM 50
LVS PROPERTY RESOLUTION MAXIMUM 65536
// LVS SIGNATURE MAXIMUM
// Reduction
// Trace Property
62
TRACE PROPERTY r(rnpolylo) l l 0
TRACE PROPERTY r(rppolylo) w w 0
TRACE PROPERTY r(rppolylo) l l 0
TRACE PROPERTY r(rnpolyhi) w w 0
TRACE PROPERTY r(rnpolyhi) l l 0
TRACE PROPERTY r(rppolyhi) w w 0
TRACE PROPERTY r(rppolyhi) l l 0
TRACE PROPERTY mn(nmos) l l 0
TRACE PROPERTY mn(nmos) w w 0
TRACE PROPERTY mn(nmos_na) l l 0
TRACE PROPERTY mn(nmos_na) w w 0
TRACE PROPERTY mn(nmos_lvt) l l 0
TRACE PROPERTY mn(nmos_lvt) w w 0
63
# ################### _ _
# # # * *
# # # CORRECT # |
# # # # \___/
# ###################
--------------------------------------------------------------------------
------------------------------------
Nets: 15 15
Instances: 11 11 MN (4 pins)
11 11 MP (4 pins)
------ ------
Total Inst: 22 22
Nets: 15 15
64
Nets: 15 15 0 0
Instances: 5 5 0 0 _invb
6 6 0 0 _invv
------- ------- --------- ---------
Total Inst: 11 11 0 0
SUMMARY
**************************************************************************
************************************
65
5.3 PEX NETLIST FOR GDI T-FLIP FLOP
* File: l3.pex.netlist
* Created: Thu Feb 19 19:42:16 2015
* Program "Calibre xRC"
* Version "v2012.4_25.21"
*
.global VDD VSS
.include "l3.pex.netlist.pex"
.subckt l3 GROUND QBAR Q T CLK
*
* CLK CLK
* T T
* Q Q
* QBAR QBAR
* GROUND GROUND
* VDD VDD
M0 N_3_M0_d N_Q_M0_g N_GROUND_M0_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M1 N_4_M1_d N_T_M1_g N_3_M1_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M2 N_5_M2_d N_4_M2_g N_GROUND_M2_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M3 N_6_M3_d N_9_M3_g N_GROUND_M3_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M4 N_7_M4_d N_CLK_M4_g N_6_M4_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M5 N_9_M5_d N_CLK_M5_g N_8_M5_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M6 N_8_M6_d N_7_M6_g N_GROUND_M6_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M7 N_11_M7_d N_CLK_M7_g N_QBAR_M7_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M8 N_QBAR_M8_d N_13_M8_g N_GROUND_M8_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-
06
M9 N_Q_M9_d N_11_M9_g N_GROUND_M9_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M10 N_13_M10_d N_CLK_M10_g N_Q_M10_s N_GROUND_M0_b NMOS L=1.3e-07 W=2e-06
M11 N_3_M11_d N_Q_M11_g N_VDD_M11_s N_VDD_M11_b PMOS L=1.3e-07 W=2e-06
M12 N_4_M12_d N_T_M12_g N_Q_M12_s N_VDD_M11_b PMOS L=1.3e-07 W=2e-06
M13 N_5_M13_d N_4_M13_g N_VDD_M13_s N_VDD_M11_b PMOS L=1.3e-07 W=2e-06
M14 N_6_M14_d N_9_M14_g N_VDD_M14_s N_VDD_M14_b PMOS L=1.3e-07 W=2e-06
M15 N_7_M15_d N_CLK_M15_g N_5_M15_s N_VDD_M11_b PMOS L=1.3e-07 W=2e-06
M16 N_9_M16_d N_CLK_M16_g N_4_M16_s N_VDD_M11_b PMOS L=1.3e-07 W=2e-06
M17 N_8_M17_d N_7_M17_g N_VDD_M17_s N_VDD_M11_b PMOS L=1.3e-07 W=2e-06
M18 N_11_M18_d N_CLK_M18_g N_6_M18_s N_VDD_M11_b PMOS L=1.3e-07 W=2e-06
M19 N_QBAR_M19_d N_13_M19_g N_VDD_M19_s N_VDD_M11_b PMOS L=1.3e-07 W=2e-06
M20 N_Q_M20_d N_11_M20_g N_VDD_M20_s N_VDD_M11_b PMOS L=1.3e-07 W=2e-06
M21 N_13_M21_d N_CLK_M21_g N_8_M21_s N_VDD_M21_b PMOS L=1.3e-07 W=2e-06
*
.include "l3.pex.netlist.L3.pxi"
*
.ends
*
*
66
5.4 POWER DISSIPATION FOR GDI T-FLIP FLOP
// Invocation args: -check -upper -ground_nodes:GROUND -eldo -o
$T_FF/newlib/newcell/default/netlist.spi -log /mgc_tree/tnsspramod/t-
ff/newlib/newcell/default/netlist_transcript -quiet
$T_FF/newlib/newcell/default
Number of cells: 6
Number of primitive instances: 25
Done...
67
/mgc_tree/AMS/aol/lib/libeldocsem_64.so
/mgc_tree/AMS/aol/lib/libeldomos2_64.so
/mgc_tree/AMS/aol/lib/libeldomos3_64.so
/mgc_tree/AMS/aol/lib/libeldobip_64.so
/mgc_tree/AMS/aol/lib/libeldodio_64.so
/mgc_tree/AMS/aol/lib/libeldojfet_64.so
/mgc_tree/AMS/aol/lib/libeldosoi_64.so
/mgc_tree/AMS/aol/lib/libeldomos4_64.so
/mgc_tree/AMS/aol/lib/libeldoasitft_64.so
/mgc_tree/AMS/aol/lib/libeldohisim_64.so
/mgc_tree/AMS/aol/lib/libeldospmod_64.so
/mgc_tree/AMS/aol/lib/libeldopsp_64.so
/mgc_tree/AMS/aol/lib/libeldomosvar_64.so
/mgc_tree/AMS/aol/lib/libeldolegtft_64.so
/mgc_tree/AMS/aol/lib/libeldomoto_64.so
/mgc_tree/AMS/aol/lib/libeldost_64.so
/mgc_tree/AMS/aol/lib/libeldobnr_64.so
/mgc_tree/AMS/aol/lib/libeldorockw_64.so
/mgc_tree/AMS/aol/lib/libeldopubhicum_64.so
/mgc_tree/AMS/aol/lib/libeldotftsh_64.so
/mgc_tree/AMS/aol/lib/libeldobta_64.so
/mgc_tree/AMS/aol/lib/libeldofas_64.so
/mgc_tree/AMS/aol/lib/libeldofascm_64.so
/mgc_tree/AMS/aol/lib/libeldosdsim_64.so
/mgc_tree/AMS/aol/lib/libeldowire_64.so
/mgc_tree/AMS/aol/lib/libogr_64.so loaded.
68
***** PRE-PROCESSING ...
***** 0 error(s).
***** 0 warning(s).
***** 0 error(s).
***** 1 warning(s).
Eldo VERSION : ELDO 14.1 (64 bits) Fri Jul 4 10:16:17 GMT 2014
Performing DC analysis...
69
X_CELL1.N$169 4.8790
X_CELL1.N$185 21.5194U
X_CELL1.N$186 5.0000
X_CELL1.N$28 4.8790
X_CELL1.N$34 566.6852M
X_CELL1.N$46 5.0000
X_CELL1.N$53 529.6748M
X_CELL1.N$59 1.9396M
................................................
Simulation progress : 10% (t = 61.2305 N)
Elapsed CPU time : 0h 0mn 0s 0 ( 0h 0mn 0s 0)
CPU Usage : 0% ( 0%)
................................................
Simulation progress : 20% (t = 121.0000 N)
Elapsed CPU time : 0h 0mn 0s 10 ( 0h 0mn 0s 10)
CPU Usage : 100% ( 83%)
................................................
Simulation progress : 30% (t = 182.2305 N)
Elapsed CPU time : 0h 0mn 0s 0 ( 0h 0mn 0s 10)
CPU Usage : 0% ( 55%)
................................................
Simulation progress : 40% (t = 242.4408 N)
Elapsed CPU time : 0h 0mn 0s 10 ( 0h 0mn 0s 20)
CPU Usage : 100% ( 90%)
................................................
Simulation progress : 50% (t = 300.0000 N)
Elapsed CPU time : 0h 0mn 0s 0 ( 0h 0mn 0s 20)
CPU Usage : 0% ( 76%)
................................................
Simulation progress : 60% (t = 361.2305 N)
Elapsed CPU time : 0h 0mn 0s 10 ( 0h 0mn 0s 30)
CPU Usage : 100% ( 96%)
................................................
Simulation progress : 70% (t = 421.0000 N)
Elapsed CPU time : 0h 0mn 0s 0 ( 0h 0mn 0s 30)
CPU Usage : 0% ( 83%)
................................................
Simulation progress : 80% (t = 482.2305 N)
Elapsed CPU time : 0h 0mn 0s 10 ( 0h 0mn 0s 40)
CPU Usage : 100% ( 97%)
................................................
70
Simulation progress : 90% (t = 542.4408 N)
Elapsed CPU time : 0h 0mn 0s 0 ( 0h 0mn 0s 40)
CPU Usage : 0% ( 88%)
................................................
Simulation progress : 100% (t = 600.0000 N)
Elapsed CPU time : 0h 0mn 0s 0 ( 0h 0mn 0s 40)
CPU Usage : 0% ( 81%)
SIMULATION INFORMATION
memory size allocated in Mbytes 259.8
Latency: 0.000000%
average number of newton iterations: 2.334630
nb of components: 25
nb of nodes: 59
nb of MOS or BIP calls: 16871
Number of steps computed: 257
==========================================================================
============
71
CHAPTER 6
COMPARISION RESULTS
6.1 COMPARISON RESULTS OF CMOS USING T-FLIP FLOP:
CELL COMPARISON RESULTS ( TOP LEVEL )
# ################### _ _
# # # * *
# # # CORRECT # |
# # # # \___/
# ###################
--------------------------------------------------------------------------
------------------------------------
Nets: 27 27
Instances: 23 23 MN (4 pins)
23 23 MP (4 pins)
------ ------
Total Inst: 46 46
Nets: 17 17
Instances: 2 2 MP (4 pins)
2 2 SPMN_2_1 (5 pins)
72
5 5 _invv (4 pins)
2 2 _nand2v (5 pins)
4 4 _nor2v (5 pins)
2 2 _smp2v (4 pins)
------ ------
Total Inst: 17 17
**************************************************************************
************************************
INFORMATION AND WARNINGS
**************************************************************************
************************************
Nets: 17 17 0 0
Instances: 2 2 0 0 MP(PMOS)
2 2 0 0 SPMN_2_1
5 5 0 0 _invv
2 2 0 0 _nand2v
4 4 0 0 _nor2v
2 2 0 0 _smp2v
------- ------- --------- ---------
Total Inst: 17 17 0 0
73
6.2 COMPARISON RESULTS OF GDI USING T-FLIP FLOP
# ################### _ _
# # # * *
# # # CORRECT # |
# # # # \___/
# ###################
--------------------------------------------------------------------------
------------------------------------
Nets: 15 15
Instances: 11 11 MN (4 pins)
11 11 MP (4 pins)
------ ------
Total Inst: 22 22
Nets: 15 15
74
**************************************************************************
************************************
INFORMATION AND WARNINGS
**************************************************************************
************************************
Nets: 15 15 0 0
Instances: 5 5 0 0 _invb
6 6 0 0 _invv
------- ------- --------- ---------
Total Inst: 11 11 0 0
75
CHAPTER 7
CONCLUSION AND FUTURE SCOPE
CONCLUSION
A novel methodology for asynchronous circuits, based on two-transistor GDI cells, was
presented. In this project we proposed a GDI T flip flop for low-power design was presented.
The proposed circuit has a simple structure, based on two Master-Slave principles, and some
gates to describe T flip flop. It contains 24 transistors. An optimization procedure was developed
for GDI TFF, based on iterative transistor sizing, while targeting a minimal power-delay product.
Performance comparison with other TFF design techniques was shown, with respect to gate area,
delay and power dissipation.
FUTURE SCOPE
Gate diffusion input (GDI) technique is used for designing the logic gates, also the
power consumption, delay, chip area and connection and parasitic capacitors are decreased
76
CHAPTER 8
BIBILOGRAPHY
77
APPENDIX-A
Below table shows the comparison values between Gate diffusion input (GDI) and
CMOS.
APPENDIX-B
78
79
80