Constraint_generation_and_placement_for_automatic_layout_design_of_analog_integrated_circuits
Constraint_generation_and_placement_for_automatic_layout_design_of_analog_integrated_circuits
Authorized licensed use limited to: ASTAR. Downloaded on November 29,2022 at 07:43:34 UTC from IEEE Xplore. Restrictions apply.
356
briefly explained in section 4. Examples on some sub circuits (graph branches). Parasitics are associated with
benchmark circuits show the effectiveness of the approach each circuit branch in order to evaluate their performance
proposed for analog circuits with a low level of integration. sensitivity to the introduction of non zero length
interconnections. In other words, our constraint generation
2. CONSTRAINTS GENERATION program, evaluates the electrical activity of each circuit
Most tools for the automatic layout generation of digital branch. We define electrical activity of a selected subcircuit
integrated circuits, are driven by general criteria, such as with respect to a single electrical performance, the
total chip area and total interconnection length maximum deviation from the ideal value of the
minimization. In the design of analog circuits, especially in performance, due to the parasitic introduction, evaluated
case of high performance applications, these goals can be of with respect to the specification tolerance attributed to that
second order importance when compared to the electrical particular performance. The electrical activity coefficients
requirements. For this reason, most programs presented in allow to single out those circuit branches that potentially
literature for the automatic placement and routing of analog can mostly af€& the final circuit performances, and that we
circuits, are dnven by electrical constraints expressing the design as critical. Critical subcircuits will have higher
dependence of the electrical performances on the parasitic priority during the layout design. While in constraints
elements introduced during the layout. generation for routing it is necessary to evaluate the
We present here a new tool for the automatic generation of influence of each single net segment on each circuit
constraints that can be applied to linear and non-linear performance, we can substantially reduce the problem
networks, at the end of the electrical synthesis and complexity by analyzing the global effect of parasitic
optimization phases, before the layout design, in order to introduction, in the network branches. Anyway, in
evaluate the dependence of each electrical circuit constraints generation for the placement phase, the analysis
performance, on the introduction of interconnection of the electrical activity of each single net segment would be
parasitics at each node. While interconnections responsible redundant and not signtficant.
of parasitic introduction, are actually drawn during the In the frequency domain, AC analysis is very fast, and the
routing phase, we demonstrated in our experiments, that the circuit performances can be efficiently evaluated for
total interconnection length can be maintained low only different parasitic values (i.e. interconnection estimated
when the device placement is optimized toward the net length), by a perturbation method; the estimated maximum
minimization. In fact, as it can be Seen in figure 1, a net length is evaluated by considering the circuit
placement configuration optimized versus the total area complexity, the dimension of the included devices and
occupation, can correspond to a very unfavorable routing statistical data on the technology.
solution. The placement of figure 1 has been performed by In analog circuits, sometimes, parasitics introduced at
Puppy, a simulated annealing based placement program for Merent nodes, reciprocally compensate their influence on
digital applications. The cost function governing the the finalcircuit performance. That is for instance the case of
placement algorithm includes terms expressing the total circuits including identical modules, repeated several times.
area occupation (main term), the total interconnection Our program investigates compensation phenomena, by
length and the device overlapping. On the other hand, when considering the simultaneous introduction of parasitics in
the placement is optimized in order to minimize at least the the most critical branches. Eventually, statistical sampling
most critical interconnections, a satisfactory routing can be employed to detect sigmficant coupling effects
solution can be more easily automatically performed. In between less critical branches.
several cases, and in particular for high frequency
applications, the electrical behavior of metal lines used as In figures2 we reported the different effects of the parasitics
interconnections, cannot be simply modeled in terms of introduction in a simple three stages microwave GaAs-
lumped capacitors, and distributed effects can not be MESFET amplifier operating in the 4-8 Gig& range.
neglected. In the frequency domain, transmission lines and Figure 2 examines the amplifier power gain. In particular it
microstrip discontinuities can be accurately and efficiently shows the effects of Werent length interconnections
described by close form equations [6]. Analytical expression introduced between the first stage active elements source
are also available, describing coupling effects and parasitics and ground.
produced by line discontinuities. Furthermore, steady state 3. THE PLACEMENT METHODOLOGY
linear and non-linear analysis in the frequency domain, are
rapid and accurate for most cases of interest. For these Circuit placement is automatically performed by a new
reasons, our approach for constraints generation, employs a constraint driven placement tool based on the well known
frequency domain, circuit simulator based on the Harmonic simuhted annealing optimization technique. Simulated
Balance Method. [6] annealing ([7]]) has been extensively employed in CAD
tools for digital applications and, in particular, in automatic
In our program, the first step of the constraint generation placement programs 181. In these programs the circuit
procedure consists of the specification of the circuit under placement is realized by generating several different
analysis in terms of a graph. The circuit graph only retains contigurations, and for each one a cost function is
non degenerate nodes and highlights the interconnection evaluatd, the final placement configuration is the one that
properties of the circuit. Furthermore, the graph minimizes the cost function. For rl selected configuration
specification of a circuit allows for a natural partitioning in
Authorized licensed use limited to: ASTAR. Downloaded on November 29,2022 at 07:43:34 UTC from IEEE Xplore. Restrictions apply.
357
this cost function linearly depends on the total area appeared to produce second order effects on the electrical
occupation, cell overlapping area and total estimated performances of the circuit. Devices included in low
interconnection length; for each term an empirical weight sensitivity branches are progressively added till the total
coefficient must be given. In principle, the cost function inclusion of each device of the circuit Symmetry constraints
governing the placement could be more complex and can be taken into account in the placement phase by
include terms expressing electrical and technological applying Merent strategies. For instance, high priority can
constraints. However our experiments showed that, in order be attributed to cells which have to be positioned
to obtain realistic results, it is necessary to attribute very symmetrically by first placing one of the branches of the
large weight coefficients to the terms depending on the total symmetrical structure, then by mirroring it, thus obtaining
area occupation and cell overlapping parameters; in this the whole symmetrical module that will be treated in the
way the cost function results almost unaf€ected by the terms following as a single non-separable module.
expressing electrical constraints. In other words, in the Automatic placement results obtained by such an approach
design of analog IC's, the plain use of simulated annealing are characterized by the fact that all devices in the most
placement tools designed for digital applications, is not critical branches occupy neighbor sites: interconnection nets
convenient. The proposed methodology to analog circuits between these devices can be very short and, as a
placement is based on a iterative placement of the circuits consequence, parasitic introduction during the routing
blocks. The placement order is defined hierarchically phase can be minimized.
following the results of the constraints generation
algorithm. Each block is placed by applying the simulated 4. ROUTING AND EXPERIMENTAL RESULTS
annealing algorithm, modified in such a way to be After the circuit placement is performed, the final routing
effectively applied to analog circuits, allowing to obtain an phase must be performed. Several papers have been
optimized placement with respect to electrical parameters. presented in literature, proposing algorithms suitable for
Every time a placement has been performed the following automatic routing of analog integrated circuits ([9], [lo]).
iterations consider the most critical subcircuits, for which Some of these papers introduce constraintdriven algorithms
layout has been already performed, as single entities. This for circuit routing govemed by a cost function generated
hierarchical approach, which can be criticized as too during the previous constraint generation phase.
expensive in terms of complexity with respect to previously We started our routing experiments using two existing
proposed approaches, can be justified by considering the low programs written for digital applications, YACR and
level of integration of analog circuits which reduces in MIGHTY ([111). In fact, since following our approach, the
practical terms the analysis complexity, allowing to obtain circuit placement is optimized in order to minimize the
optimal results with respect to electrical constraints. critical interconnection length, we assumed that the routing
Let us detail the constraintsdriven placement methodology. problem could be solved using standard algorithms.
The system considers, at first, the circuit branches that Unfortunately these programs do not behave effectively for
were determined to be most critical during the previous analog circuits that are characterized by large channels and
constraint generation phase, that is, the branches for which small interconnection number; in this case in fact, they tend
parasitic introduction mostly affects circuit performances. to introduce unnecessary long paths and useless bents.
For each branch separately, the system performs the Therefore we modified the original algorithms by
automatic placement of the device cells, using a classical introducing a priority function associated with each net.
simulated annealing algorithm, whose cost function only Such fimction is employed together with the vertical
depends on three parameters: total area occupation, cell constraint graph which drives the rows occupation by the
overlapping, total estimated interconnection length. In nets. These modifications have provided a substantial
particular, the total length of interconnections is an improvement in the routing quality as shown in fig. 3.
important parameter in the cost function evaluation: some Nevertheless the results obtained are not completely
c o n f i rtions which would affect the electrical parameters satisfactory, and we are now defining a completely new
are m d e d a priori, even before evaluating the cost approach to the routing problem, based on the automatic
function. For instance, those configurations with an definition of a cost function expressing electrical and
overlapping greater than 20% of the total area occupied by a symmetry constraints. The main goal of this new approach
subcircuit (or the entire chip, in case of the final global is the exploitation of the analog circuit characteristics, such
placement) are discarded. Furthermore, the cost function as the low integration level and the placement optimization
includes a term which constrains the C O M ~ C ~ O ~of
S the sub
with respect to the minimization of the electrical
circuit to the rest of the network to lie on the devices interconnections.
boundaries. After the optimal placement of the critical In the new algorithm, after the definition of the symmetry
subcircuits has been completed, the global placement of the constraints, the critical nets are determined by considering
circuit is performed. The modules are constituted by the one net at a time. For each net the worst configuration with
critical sub circuits treated as non separable entities and by respect to performance degradation is determined by
the elementary cells belonging to those branches determined simulation. A net is considered critical if the performance
to be less critical by the constraints generation algorithm, degradation is higher than a predefined upper bound
i.e. the branches for which the introduction of parasitics (determined by the specification performance tolerance
Authorized licensed use limited to: ASTAR. Downloaded on November 29,2022 at 07:43:34 UTC from IEEE Xplore. Restrictions apply.
358
Authorized licensed use limited to: ASTAR. Downloaded on November 29,2022 at 07:43:34 UTC from IEEE Xplore. Restrictions apply.