## Analog Placement with Common Centroid and 1-D Symmetry Constraints (2009)

Citations: | 1 - 1 self |

### BibTeX

@MISC{Xiao09analogplacement,

author = {Linfu Xiao and Evangeline F. Y. Young},

title = { Analog Placement with Common Centroid and 1-D Symmetry Constraints},

year = {2009}

}

### OpenURL

### Abstract

In this paper, we will present a placement method for analog circuits. We consider both common centroid and 1-D symmetry constraints, which are the two most common types of placement requirements in analog designs. The approach is based on a symmetric feasible condition on the sequence pair representation that can cover completely the set of all placements satisfying the common centroid and 1-D symmetry constraints. This condition is essential for a good searching process to solve the problem effectively. Symmetric placement is an important step to achieve matchings of other electrical properties like delay and temperature variation. We have compared our results with those presented in the most updated previous works. Significant improvements can be obtained by our approach in both common centroid and 1-D symmetry placements, and we are the first who can handle both constraints simultaneously.

### Citations

63 | Rectangle-Packing-Based Module Placement
- Murata, Fujiyoshi, et al.
- 1995
(Show Context)
Citation Context ...ment process. IV. SEQUENCE PAIR to denote the position of block A in the α sequence. The topological relations between two blocks A and B in a sequence pair are given as follows: A sequence-pair (SP) =-=[3]-=-, describing a general placement of n blocks, is an ordered pair (α,β), where α and β are permutations of the block names. We use αi to denote the block occupying the ith position in sequence α and us... |

53 | Corner block list: An effective and efficient topological representation of non-slicing floorplan - Hong, Huang, et al. - 2000 |

38 | D.F.: Fast-SP: a fast algorithm for block placement based on sequence
- Tang, Wong
- 2001
(Show Context)
Citation Context ...p4g” are shown in Fig. 8 and Fig. 9. 1 1 1 1 1 1 1 1 VII. EXPERIMENTAL RESULTS Our analog placer was implemented with the C programming language using the fast sequence pair evaluation algorithm [16] =-=[17]-=- and all the experiments were performed on an Intel(R) XEON(TM) CPU 2.20GHz linux workstation with 1 GB memory. We have done three sets of experiments. In the first two sets, we compared our approach ... |

29 | A performance-driven placement tool for analog integrated circuits,” Solid-State Circuits - Lampaert, Gielen, et al. - 1995 |

28 | D.F.: Fast evaluation of sequence pair in block placement by longest common subsequence computation
- Tang, Tian, et al.
(Show Context)
Citation Context ...ias 2p4g” are shown in Fig. 8 and Fig. 9. 1 1 1 1 1 1 1 1 VII. EXPERIMENTAL RESULTS Our analog placer was implemented with the C programming language using the fast sequence pair evaluation algorithm =-=[16]-=- [17] and all the experiments were performed on an Intel(R) XEON(TM) CPU 2.20GHz linux workstation with 1 GB memory. We have done three sets of experiments. In the first two sets, we compared our appr... |

28 | FLUTE: Fast lookup table based wirelength estimation technique - Chu - 2008 |

22 | Automation of IC Layout with Analog Constraints - Malavasi, Charbon, et al. - 1996 |

16 | Arbitrary Rectilinear Block Packing Based
- Kang, Dai
- 1998
(Show Context)
Citation Context ...troid Placement Consider a common centroid placement of a single group g and its corresponding extracted sequence pair (αg,βg). When a 3 This condition is equivalent to one of the three conditions in =-=[19]-=- for feasible recovering of rectilinear blocks from a sequence pair representation. However, that is unrelated to our current problem since we are now dealing with the condition for common centroid or... |

13 |
K.Lampaert “Symmetry within the Sequence-Pair Representation in the Context of Placement for Analog Design
- Balasa
- 2000
(Show Context)
Citation Context ...ious Works In 1-D symmetric placement, pairs of cells are required to be placed symmetrically with respect to a horizontal or a vertical axis. This problem has been studied extensively. Balasa et al. =-=[8]-=- derived a 1-D symmetric-feasible condition for the sequence pair representation. Lin et al. [11] presented a 1-D symmetric-feasible condition for the TCG-S representation. Kouda et al. [14] further l... |

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 |

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

6 | et al., “KOAN/ANAGRAM II: New Tools for Device-Level Analog Placement and Routing - Cohn - 1991 |

5 | Analog placement with common centroid constraints
- Ma, Young, et al.
- 2007
(Show Context)
Citation Context ... proposed a symmetry-aware placement method based on the Transitive Closure Graph (TCG) representation and derived a symmetric-feasible condition on TCG. For the common centroid constraint, Ma et al. =-=[2]-=- proposed a method based on the C-CBL representation, which can handle mosaic packings only. B. Our Contributions In this paper, we will present an analog placement tool that can handle both common ce... |

5 | Analog Device-level Automation - Cohn, Garrod, et al. - 1994 |

5 |
Analog placement based on novel symmetryisland formulation
- Lin, Lin
- 2007
(Show Context)
Citation Context .... Tam et al. [12] handled 1-D symmetry by inserting dummy nodes into constraint graphs and their approach can handle other placement constraints in addition to the 1-D symmetry constraint. Lin et al. =-=[13]-=- proposed a placement algorithm based on the B*-tree representation to handle both 1-D and 2-D symmetry. Zhang et al. [15] proposed a symmetry-aware placement method based on the Transitive Closure Gr... |

4 | Placement with symmetry constraints for analog layout design using TCG-S
- Lin, Wu, et al.
- 2005
(Show Context)
Citation Context ...th respect to a horizontal or a vertical axis. This problem has been studied extensively. Balasa et al. [8] derived a 1-D symmetric-feasible condition for the sequence pair representation. Lin et al. =-=[11]-=- presented a 1-D symmetric-feasible condition for the TCG-S representation. Kouda et al. [14] further looked into the symmetricfeasible condition in sequence pair and proposed a linear programming bas... |

4 | Analog Placement with Symmetry and Other Placement Constraints
- Tam, Young, et al.
- 2006
(Show Context)
Citation Context ...tric-feasible condition for the TCG-S representation. Kouda et al. [14] further looked into the symmetricfeasible condition in sequence pair and proposed a linear programming based method. Tam et al. =-=[12]-=- handled 1-D symmetry by inserting dummy nodes into constraint graphs and their approach can handle other placement constraints in addition to the 1-D symmetry constraint. Lin et al. [13] proposed a p... |

3 |
Improved method of cell placement with symmetry constraints for analog IC layout design
- Kouda, Kodama, et al.
(Show Context)
Citation Context ...asa et al. [8] derived a 1-D symmetric-feasible condition for the sequence pair representation. Lin et al. [11] presented a 1-D symmetric-feasible condition for the TCG-S representation. Kouda et al. =-=[14]-=- further looked into the symmetricfeasible condition in sequence pair and proposed a linear programming based method. Tam et al. [12] handled 1-D symmetry by inserting dummy nodes into constraint grap... |

3 |
Symmetry-Aware Placement with Transitive Closure Graphs for Analog Layout Design
- Zhang, Shi, et al.
(Show Context)
Citation Context ... placement constraints in addition to the 1-D symmetry constraint. Lin et al. [13] proposed a placement algorithm based on the B*-tree representation to handle both 1-D and 2-D symmetry. Zhang et al. =-=[15]-=- proposed a symmetry-aware placement method based on the Transitive Closure Graph (TCG) representation and derived a symmetric-feasible condition on TCG. For the common centroid constraint, Ma et al. ... |