## Constraints Space Management for the Layout of Analog IC's (1998)

### Cached

### Download Links

- [donau.et.tudelft.nl]
- [www.hwswworld.com]
- DBLP

### Other Repositories/Bibliography

Venue: | In Proc. Design Automation & Test in Europe |

Citations: | 2 - 1 self |

### BibTeX

@INPROCEEDINGS{Arsintescu98constraintsspace,

author = {Bogdan G. Arsintescu and Ralph H. J. M. Otten},

title = {Constraints Space Management for the Layout of Analog IC's},

booktitle = {In Proc. Design Automation & Test in Europe},

year = {1998}

}

### OpenURL

### Abstract

An automated technique to narrow down the number of constraints in analog layout is described. The set of most important layout constraints is determined, discarding unnecessary constraints. The method is based on principal component analysis of the sensitivity matrix. Experimental results suggest the effectiveness of the method with respect to parasitic estimation and to the error margin. The results are compared with human designers' art in hand-crafted constraints confinement. 1. Introduction High performance analog IC layout is the more laborious part of an IC design task. The main problems in today's deep-submicron layout design are stray parasitics, signal integrity and crosstalk, which forces the designers to adopt special strategies for state-of-the-art analog design. Analog and mixed design are facing the problems of low-power low-voltage requirements, which further complicate analog layout. This generally results in costly iterations between behavioral and physical design, i...

### Citations

2099 |
Matrix computations
- Golub, Loan
- 1996
(Show Context)
Citation Context ...ata (A; b). C is at least 1 and can be very large even for matrices with reasonable singular values. The computational complexity of the SVD is O(n 3 + mn 2 ) for a matrix of size (m; n) according to =-=[10]-=- (pp.254). By proper definition of the matrix to be decomposed (that is, minimizing the number of columns) the time spent on the computation of the SVD is further reduced. 3. The constraints character... |

59 |
The generalized adjoint network and network sensitivities
- Director, Rohrer
- 1969
(Show Context)
Citation Context ...is performed on the sensitivity matrix. 2.1 Sensitivity Analysis Sensitivity analysis is widely used in circuit design and optimization. It is usually related to adjoint network theory, introduced in =-=[7]-=-. Definition 1 The differential sensitivity s F p and the normalized sensitivity S F p of a performance function F with respect to the parameter p are defined respectively as: s F p j \DeltaF \Deltap ... |

59 |
Design of Analog Integrated Circuits and Systems. McGraw-Hill Int
- Laker, Sansen
- 1994
(Show Context)
Citation Context ...e yet mismatch sensitivities, two values for every pair are given. The mismatch sensitivity is also just a matter of notation in [12]. The second example (the Cascode OTA in Figure 5.a) is taken from =-=[13]-=- and used to prove the strength of the method with respect to device dimensions sensitivities. Comparing the Figure 5.b columns, one can note that FORCES produced a list containing (among others) the ... |

51 |
DELIGHT.SPICE: An Optimization-Based System for the Design of Integrated Circuits
- Nye, Riley, et al.
- 1988
(Show Context)
Citation Context ...mmetry and matching. Topology constrained methods have been proposed in [1, 2, 3] in order to minimize the parasitic effects by source-drain abutment and device grouping. Circuit optimization methods =-=[4]-=- take care of the analog specific constraints in the early stages of the design. Yet, the layout of high-performance analog modules remains time consuming and is often becoming the bottleneck of the e... |

40 | A top-down, constraint-driven design methodology for analog integrated circuits - Chang, Sangiovanni-Vincentelli, et al. - 1992 |

37 |
A Performance-Driven Placement Tool for Analog Integrated Circuits
- Lampaert, Gielen, et al.
- 1995
(Show Context)
Citation Context ... the layout of high-performance analog modules remains time consuming and is often becoming the bottleneck of the entire design. Parasitic bounding and degradation evaluation methods were proposed in =-=[5, 6]-=-. The method introduced in [5] maximizes a measure of layout flexibility based on sensitivity analysis and quadratic optimization. Layout flexibility, however, is hard to quantify and time consuming i... |

26 | Automation of IC Layout with Analog Constraints
- Malavasi, Charbon, et al.
- 1996
(Show Context)
Citation Context ...al aspects related to layout (critical device dimensions). The last example shows the local constraints confinement capabilities of the method. The first example is a clocked comparator COMPL used in =-=[12]-=- because of its performance dependence to layout (see Figure 4.a). As expected, the input pair and also the offset stage are very sensitive. The first column in Figure 4.b presents the list of paramet... |

22 |
Analog Device-Level Layout Automation
- Cohn, Garrod, et al.
- 1994
(Show Context)
Citation Context ...to market. Analog design is known to be highly dependent on layout induced parasitics and specific analog constraints such as symmetry and matching. Topology constrained methods have been proposed in =-=[1, 2, 3]-=- in order to minimize the parasitic effects by source-drain abutment and device grouping. Circuit optimization methods [4] take care of the analog specific constraints in the early stages of the desig... |

15 |
Optimum CMOS Stack Generation with Analog Constraints
- Malavasi
- 1995
(Show Context)
Citation Context ...to market. Analog design is known to be highly dependent on layout induced parasitics and specific analog constraints such as symmetry and matching. Topology constrained methods have been proposed in =-=[1, 2, 3]-=- in order to minimize the parasitic effects by source-drain abutment and device grouping. Circuit optimization methods [4] take care of the analog specific constraints in the early stages of the desig... |

12 |
Sensitivity and optimization
- Brayton, Spence
(Show Context)
Citation Context ...trated in [7] that the entire sensitivity matrix of a parametric circuit can be completely resolved with only two circuit calculations using the generalized adjoint network and Tellegen's theorem. In =-=[8]-=- two algorithms are proposed, one with computational cost of O(Gn ) and another one with the cost O(Gn + n 2 ), where Gn = O(n 3 ) denotes the cost of a Gaussian Elimination performed on an n \Theta n... |

8 |
Automatic generation of parasitic constraints for performance-constrained physical design of analog circuits
- Choudhury, Sangiovanni-Vincentelli
- 1993
(Show Context)
Citation Context ... the layout of high-performance analog modules remains time consuming and is often becoming the bottleneck of the entire design. Parasitic bounding and degradation evaluation methods were proposed in =-=[5, 6]-=-. The method introduced in [5] maximizes a measure of layout flexibility based on sensitivity analysis and quadratic optimization. Layout flexibility, however, is hard to quantify and time consuming i... |

7 |
Singular value decomposition, an introduction
- Dewilde, Deprettere
- 1988
(Show Context)
Citation Context ... min (m; n) and w isw i+1 ; i = 1 : : : p such that U SV = \Sigma ) S = U\SigmaV (4) where \Sigma = diagfw 1 ; : : : ; w p g and V is the transposed conjugate of V. A proof of the theorem is given in =-=[9]-=-. In what follows, some terms and some properties of the matrices relevant to the methodology are summarized. The reader is referred to [9] for the proofs of the properties. Property 1 Orthonormality:... |

4 |
A programmable 1.5 V CMOS class-AB operational amplifier with hybrid nested Miller compensation for 120 dB gain and 6 MHz UGF
- Eschauzier, Hogervorst, et al.
- 1994
(Show Context)
Citation Context ...ally and do not have to be specified by the user. A more complex example is the micro power amplifier in Figure 6. This is a low-voltage op-amp (1.5V) with multipath hybrid nested Miller compensation =-=[14, 12]-=-. From a total of over 200 constraints, only 54 are selected excluding matching. Due to space limitations, the constraints table is omitted. The constraints set show that most of the constraints are r... |

3 | Analog IC Design: Part II - Automated Circuit Correction by Qualitative Reasoning - Makris, Toumazou - 1995 |

2 | Global stacking for analog circuits
- Arsintescu, Spanoche
- 1996
(Show Context)
Citation Context ...to market. Analog design is known to be highly dependent on layout induced parasitics and specific analog constraints such as symmetry and matching. Topology constrained methods have been proposed in =-=[1, 2, 3]-=- in order to minimize the parasitic effects by source-drain abutment and device grouping. Circuit optimization methods [4] take care of the analog specific constraints in the early stages of the desig... |