## Analog Placement Based on Symmetry-Island Formulation

### BibTeX

@MISC{Lin_analogplacement,

author = {Po-hung Lin and Yao-wen Chang and Shyh-chang Lin},

title = {Analog Placement Based on Symmetry-Island Formulation},

year = {}

}

### OpenURL

### Abstract

Abstract—To reduce the effect of parasitic mismatches and circuit sensitivity to thermal gradients or process variations for analog circuits, some pairs of modules need to be placed symmetrically with respect to a common axis, and the symmetric modules are preferred to be placed at closest proximity for better electrical properties. Most previous works handle the problem with symmetry constraints by imposing symmetric-feasible conditions in floorplan representations and using cost functions to minimize the distance between symmetric modules. Such approaches are inefficient due to the large search space and cannot guarantee the closest proximity of symmetry modules. In this paper, we present the first linear-time-packing algorithm for the placement with symmetry constraints using the topological floorplan representations. We first introduce the concept of a symmetry island which is formed by modules of the same symmetry group in a single connected placement. Based on this concept and the B ∗-tree representation, we propose automatically symmetric-feasible (ASF) B ∗-trees to directly model the placement of a symmetry island. We then present hierarchical B ∗-trees (HB ∗-trees) which can simultaneously optimize the placement with both symmetry islands and nonsymmetric modules. Unlike the previous works, our approach can place the symmetry modules in a symmetry group in close proximity and significantly reduce the search space based on the symmetry-island formulation. In particular, the packing time for an ASF-B ∗-tree or an HB ∗-tree is the same as that for a plain B ∗-tree (only linear) and much faster than previous works. Experimental results show that our approach achieves the best-published quality and runtime efficiency for analog placement. Index Terms—Analog circuit, floorplanning, physical design, placement. I.

### Citations

3529 | Optimization by simulated annealing - Gelatt, Vecchi - 1983 |

207 | Matching properties of mos transistors
- Pelgrom, Duinmaijer, et al.
- 1989
(Show Context)
Citation Context ...etry Island Before introducing the symmetry island, we shall first investigate the effect of the symmetric device layout on the electrical matching properties of the symmetric devices. Pelgrom et al. =-=[20]-=- measured the mismatch between MOS transistors with various electrical parameters as a function of device areas, distances, and orientations. According to Pelgrom et al. [20], the difference of an ele... |

92 | B*-trees: A new representation for nonslicing floorplans
- Chang, Chang, et al.
(Show Context)
Citation Context ...pular floorplan representations including sequence pairs (SPs) [8], O-tree [9], and binary trees [10]. To explore the solution space in the symmetric-feasible binary trees, they augmented the B∗-tree =-=[11]-=- using various data structures, including segment trees [3], [12], red–black trees [13], and deterministic skip lists [14]. Lin et al. [15] also presented the symmetric-feasible conditions for the TCG... |

39 |
KOAN/ANAGRAM II: New tools for device-level analog placement and routing
- Cohn, Rutenbar, et al.
- 1991
(Show Context)
Citation Context ...spect to a common axis. The symmetric placement has several advantages: It reduces the effect of parasitic mismatches which may lead to higher offset voltages and degrade power-supply rejection ratio =-=[2]-=-. It can also reduce the circuit sensitivity to process variations Manuscript received May 31, 2008; revised October 15, 2008 and January 6, 2009. Current version published May 20, 2009. This paper wa... |

29 |
A performance-driven placement tool for analog integrated circuits,” Solid-State Circuits
- Lampaert, Gielen, et al.
- 1995
(Show Context)
Citation Context ...representation, each module is associated with an absolute coordinate on a gridless plane. It operates on a module by changing its coordinate directly. The KOAN/ANAGRAM II [2], PUPPY-A [6], and LAYLA =-=[7]-=- systems all adopted the absolute representation to handle the placement of analog modules. The main weakness of the absolute method lies in the fact that it may generate an infeasible placement with ... |

21 | Automation of IC layout with analog constraints
- Malavasi, Charbon, et al.
- 1996
(Show Context)
Citation Context ... [5]. For this representation, each module is associated with an absolute coordinate on a gridless plane. It operates on a module by changing its coordinate directly. The KOAN/ANAGRAM II [2], PUPPY-A =-=[6]-=-, and LAYLA [7] systems all adopted the absolute representation to handle the placement of analog modules. The main weakness of the absolute method lies in the fact that it may generate an infeasible ... |

13 |
K.Lampaert “Symmetry within the Sequence-Pair Representation in the Context of Placement for Analog Design
- Balasa
- 2000
(Show Context)
Citation Context ...loorplan representations due to its flexibility and effectiveness. Balasa et al. derived the symmetric-feasible conditions for several popular floorplan representations including sequence pairs (SPs) =-=[8]-=-, O-tree [9], and binary trees [10]. To explore the solution space in the symmetric-feasible binary trees, they augmented the B∗-tree [11] using various data structures, including segment trees [3], [... |

9 | On the exploration of the solution space in analog placement with symmetry constraints,” Computer-Aided Design of Integrated Circuits and Systems
- Balasa, Maruvada, et al.
- 2004
(Show Context)
Citation Context ...experiments: One is based on the four MCNC benchmarks (apte, hp, ami33, and ami49) used in [15], and the other consists of two real industry analog designs (biasynth_2p4g and lnamixbias_2p4g) used in =-=[12]-=- and [16] (note that they both were extracted by Koda et al. [16] from [12, Figs. 9 and 10]). Table III lists the names of the MCNC benchmark circuits (“Circuit”), the numbers of modules (“# of Mod.”)... |

9 | Module placement with boundary constraints using the sequence-pair representation
- Lai, Lin, et al.
- 2001
(Show Context)
Citation Context ..., the symmetric-feasible condition is always satisfied. The case for a symmetry group with a horizontal symmetry axis can be proved similarly. Q.E.D. According to Lemma 1 and the boundary constraints =-=[21]-=- in the B ∗ -trees, we have the following property for the symmetricfeasible representative B ∗ -trees representing 1-D symmetric placement. Property 1: The left-boundary (right-boundary) constraint f... |

8 | Block Placement with Symmetry Constraints based on the O-tree Nonslicing Representation - Pang, Balasa, et al. - 2000 |

6 |
Macro Placement by Monte Carlo Annealing
- Gelatt
- 1983
(Show Context)
Citation Context ...ts. We can classify these representations into two major categories: 1) the absolute representation and 2) the topological representation. An absolute representation was proposed by Jepsen and Gellat =-=[5]-=-. For this representation, each module is associated with an absolute coordinate on a gridless plane. It operates on a module by changing its coordinate directly. The KOAN/ANAGRAM II [2], PUPPY-A [6],... |

6 |
Placement with Alignment and Performance Constraint Using the B*-tree Representation
- Wu, Chang
- 2004
(Show Context)
Citation Context ... dummy block, the symmetry islands of different symmetry groups can be aligned with respect to a common vertical (horizontal) symmetry axis. Such an alignment technique is an extension of the work in =-=[23]-=-. 2) Hierarchical Symmetry: In some fully symmetric analog designs, the device layouts should be hierarchically symmetric. Authorized licensed use limited to: National Taiwan University. Downloaded on... |

5 |
Analog placement based on novel symmetryisland formulation
- Lin, Lin
- 2007
(Show Context)
Citation Context ...eceived May 31, 2008; revised October 15, 2008 and January 6, 2009. Current version published May 20, 2009. This paper was presented in part at the 2007 ACM/IEEE Design Automation Conference (DAC’07) =-=[1]-=-. This work was supported in part by Springsoft, by Etron, by TSMC, and by the National Science Council of Taiwan under Grants NSC-096-2917-I-002-121, NSC 93-2815-C-002-046-E, NSC 94-2215-E-002-005, a... |

5 |
8] “Red-Black Interval Trees in Device-Level Analog Placement”, in collaboration with
- Balasa, Maruvada, et al.
- 2003
(Show Context)
Citation Context ...ary trees [10]. To explore the solution space in the symmetric-feasible binary trees, they augmented the B∗-tree [11] using various data structures, including segment trees [3], [12], red–black trees =-=[13]-=-, and deterministic skip lists [14]. Lin et al. [15] also presented the symmetric-feasible conditions for the TCG-S representation. Three more recent works [16]–[18] further took advantage of the symm... |

4 |
Efficient solution space exploration based on segment trees in analog placement for analog placement with symmetry constraints,” ICCAD
- Balasa, Krishnamoorthy
- 2002
(Show Context)
Citation Context ...fier 10.1109/TCAD.2009.2017433 by placing the symmetric devices closed to each other. Failure to adequately balance thermal coupling in a differential circuit can even introduce unwanted oscillations =-=[3]-=-. Furthermore, the symmetric modules are preferred to be placed at closest proximity for better parasitic matching and other electrical properties. A. Previous Work The problem of analog placement con... |

4 | Placement with symmetry constraints for analog layout design using TCG-S
- Lin, Wu, et al.
- 2005
(Show Context)
Citation Context ... symmetric-feasible binary trees, they augmented the B∗-tree [11] using various data structures, including segment trees [3], [12], red–black trees [13], and deterministic skip lists [14]. Lin et al. =-=[15]-=- also presented the symmetric-feasible conditions for the TCG-S representation. Three more recent works [16]–[18] further took advantage of the symmetric-feasible condition in SPs [8]. Koda et al. [16... |

4 | Analog Placement with Symmetry and Other Placement Constraints
- Tam, Young, et al.
- 2006
(Show Context)
Citation Context ...-S representation. Three more recent works [16]–[18] further took advantage of the symmetric-feasible condition in SPs [8]. Koda et al. [16] proposed a linear-programming-based method, and Tam et al. =-=[17]-=- introduced a dummy node and additional constraint edges for each symmetry group after obtaining a symmetric-feasible SP. Krishnamoorthy et al. [18] proposed an O(m · n lg lg n) packing-time algorithm... |

3 |
Modeling Non-Slicing Floorplans with Binary Trees.” ICCAD
- Balasa
(Show Context)
Citation Context ...s flexibility and effectiveness. Balasa et al. derived the symmetric-feasible conditions for several popular floorplan representations including sequence pairs (SPs) [8], O-tree [9], and binary trees =-=[10]-=-. To explore the solution space in the symmetric-feasible binary trees, they augmented the B∗-tree [11] using various data structures, including segment trees [3], [12], red–black trees [13], and dete... |

3 |
Symmetry-Aware Placement with Transitive Closure Graphs for Analog Layout Design
- Zhang, Shi, et al.
(Show Context)
Citation Context ...y et al. [18] proposed an O(m · n lg lg n) packing-time algorithm by employing the priority queue, where m is the number of symmetry groups and n is the number of modules. More recently, Zhang et al. =-=[19]-=- further improved the perturbation time of the TCG representation from O(n2 ) to O(n). 0278-0070/$25.00 © 2009 IEEE Authorized licensed use limited to: National Taiwan University. Downloaded on Decemb... |

3 |
Analog placement based on hierarchical module clustering
- Lin, Lin
- 2008
(Show Context)
Citation Context ...(Sk,S′ k top-level symmetry group STop contains all device modules and other symmetry groups hierarchically. Based on the proposed symmetry-island and tree formulations, a hierarchical tree structure =-=[24]-=- that mixes both the ASF-B∗-trees and the HB∗-trees can be constructed. The optimized fully symmetric placement with the hierarchical symmetry constraint can then be obtained by searching a desired co... |

2 | Topological placement with multiple symmetry groups of devices for analog layout design - Krishnamoorthy, Maruvada, et al. - 2007 |

1 | Deterministic skip lists in analog topological placement
- Maruvada, Berkman, et al.
(Show Context)
Citation Context ...tion space in the symmetric-feasible binary trees, they augmented the B∗-tree [11] using various data structures, including segment trees [3], [12], red–black trees [13], and deterministic skip lists =-=[14]-=-. Lin et al. [15] also presented the symmetric-feasible conditions for the TCG-S representation. Three more recent works [16]–[18] further took advantage of the symmetric-feasible condition in SPs [8]... |

1 |
Linear programming-based cell placement with symmetry constraints for analog IC layout
- Koda, Kodama, et al.
- 2007
(Show Context)
Citation Context ...e table that our algorithm runs much faster than the previous works. In the second set of experiments, we compared our algorithm with SPs in [8], segment trees in [12], SPs with linear programming in =-=[16]-=-, and SPs with dummy nodes in [17]. Table VI lists the names of the industry benchmark circuits, the total areas, and the runtime for SPs, segment trees, SPs with linear programming, SPs with dummy no... |

1 |
Rectilinear block placement using
- Wu, Chang, et al.
- 2003
(Show Context)
Citation Context ... example, in Fig. 8(c), the symmetry island of the symmetry group S0 is of the rectilinear shape. Therefore, we should augment the HB∗-tree in Fig. 7 to handle rectilinear symmetry islands. Wu et al. =-=[22]-=- proposed a method to deal with rectilinear modules by slicing a rectilinear module into several rectangular submodules along each vertical boundary. However, it is complicated to maintain the relatio... |