A Matching-based Placement and Routing System for Analog Design

Lin, Po-Hung; Yu, Ho-Che; Tsai, Tian-Hau; Lin, Shyh-Chang

doi:10.1109/vdat.2007.373200

Cited by 28 publications

(11 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the IC-level exact matching problem is significantly different because 1) each metal layer has a horizontal or vertical routing orientation unlike mostly-planar routing in board-level routing, 2) different metal layers can have different electrical properties, and 3) the matching requirement for analog nets is more stringent because the correct functionality of the circuit depends on matching. In a relatively recent work, Lin et al [5] studied the transistor-level analog device and interconnect matching problems. However, that work does not focus on how to compute matching routes between different devices, which can be in different locations of the design.…”

Section: Preliminaries and Related Workmentioning

confidence: 99%

Maze routing algorithms with exact matching constraints for analog and mixed signal designs

Özdal

Hentschke

2012

Proceedings of the International Conference on Computer-Aided Design

View full text Add to dashboard Cite

Design automation for analog and mixed signal designs has become more important, as analog and digital components are integrated on the same system-on-chips (SOCs). Exact route matching is an important constraint for analog and mixed signal designs with nonuniform metal stacks. In this paper, we propose a constrained-path based maze routing algorithm that can handle exact matching constraints for multiple nets. We also propose a scalable framework that utilizes the proposed maze routing algorithm for realistic problem sizes. Compared to the pattern routing algorithms proposed recently [8], our algorithms allow a more thorough exploration of the solution space by allowing bends to be inserted to avoid congested regions. The experimental study demonstrates that the proposed algorithm leads to significant reductions in congestion costs compared to the previous algorithm.

show abstract

Section: Preliminaries and Related Workmentioning

confidence: 99%

Maze routing algorithms with exact matching constraints for analog and mixed signal designs

Özdal

Hentschke

2012

Proceedings of the International Conference on Computer-Aided Design

View full text Add to dashboard Cite

show abstract

“…For example, Lin et al [10] proposed a pattern based approach by predefining various matching patterns and selecting the best one during placement. Instead of applying the pattern based approach, Ma and Young [11] investigated possible common centroid placements using the center-based corner-block-list (C-CBL) representation and a grid based approach.…”

Section: Previous Workmentioning

confidence: 99%

“…n G 11 further contains another ASF-B*-tree consisting of n r G 2 and n r G 5 which denote the representative of the matching groups G 2 and G 5 respectively. It should be noted that we never extend the HB*-trees to represent the placement of matching device because our hierarchical framework can easily integrate with other approaches such the pattern based approach [10] and the grid-based approach [11] for better considering the special placement requirements of matching devices.…”

Section: Hierarchical Frameworkmentioning

confidence: 99%

See 1 more Smart Citation

Analog placement based on hierarchical module clustering

Lin

Lin²

2008

Proceedings of the 45th Annual Design Automation Conference

Self Cite

View full text Add to dashboard Cite

In analog layout design, it is very important to reduce the parasitic coupling effects and improve the circuit performance. Consequently, the most important device-level placement constraints are matching, symmetry, and proximity. However, many previous works deal with these constraints separately, and none of them mention how to handle different constraints simultaneously and hierarchically. In this paper, we first give a case study to show the needs of integrating these constraints in a hierarchical manner. Then, we present the first formulation for analog placement based on hierarchical module clustering. Our approach can handle analog placement with various constraint groups including matching, (hierarchical) symmetry, and (hierarchical) proximity groups. To our best knowledge, this is also the first work in the literature to handle floorplanning with the clustering constraint using the B*-tree based representation. Experimental results based on industrial analog designs show that our approach is very effective and efficient.

show abstract

“…For analog channel routing, Malavasi et al [8] and Choudhury and Sangiovanni-Vincentelli [15] worked on the constraint-graph-based algorithms to handle the mirror symmetry. Recently, Lin et al [16] proposed a pattern-based router to consider matching devices. Aside from the symmetry constraint, Ozdal and Hentschke [3], [4] proposed a mathematical model and a constrained-path-based maze routing algorithm for the exact-matching constraint, and Gao et al [2] proposed a two-stage framework to further consider the obstacles for preferred direction routing in a circuit.…”

Section: Introductionmentioning

confidence: 99%

Nonuniform Multilevel Analog Routing With Matching Constraints

Chien²,

Chang

2014

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

View full text Add to dashboard Cite

Symmetry, common-centroid, topology-matching, and length-matching constraints are four major routing considerations to improve the performance of an analog circuit. Symmetry constraints are specified to route matched nets symmetrically with respect to some common axes. Common-centroid constraints are also specified to route matched net symmetrically with respect to some common centers. Topology-matching constraints are commonly imposed on critical yet asymmetry nets with the same number of bends, vias, and wirelength. Length-matching constraints are specified to route the nets which have limited resources with the same wirelength. These four constraints can reduce current mismatches and unwanted electrical effects between two critical nets. In this paper, we propose the first work to simultaneously consider the four constraints for analog routing while minimizing total wirelength, bend numbers, via counts, and coupling noise at the same time. We first present a basic integer linear programming (ILP) formulation to simultaneously consider the four constraints for analog routing. Then, a prioritized-constraint-aware routing algorithm is proposed to assist analog designers for assigning the four matching constraints and optimizing routing topologies. Effective reduction techniques are also employed to reduce the numbers of ILP variables and constraints for the two routing algorithms. To further enhance the routing performance, a nonuniform multilevel routing framework is presented and integrated into our routing algorithms. Experimental results show that our approach can obtain better routing results and satisfy all specified routing constraints while optimizing circuit performance.

show abstract

A Matching-based Placement and Routing System for Analog Design

Cited by 28 publications

References 8 publications

Maze routing algorithms with exact matching constraints for analog and mixed signal designs

Maze routing algorithms with exact matching constraints for analog and mixed signal designs

Analog placement based on hierarchical module clustering

Nonuniform Multilevel Analog Routing With Matching Constraints

Contact Info

Product

Resources

About