2007 IEEE International Symposium on Circuits and Systems (ISCAS) 2007
DOI: 10.1109/iscas.2007.378437
|View full text |Cite
|
Sign up to set email alerts
|

Topological Placement with Multiple Symmetry Groups of Devices for Analog Layout Design

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
22
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 22 publications
(22 citation statements)
references
References 9 publications
0
22
0
Order By: Relevance
“…Optimization algorithms translate the design problem into an abstract model and search for an optimal solution regarding specific aims and constraints. When applied to analog layout, suchlike approaches usually focus on one specific design step (particularly placement, as in [4] and [5], and routing, as in [6] and [7]) and its respective difficulties. Relatively few works, such as [8] and [9], deal with the challenge of handling these two heavily correlated tasks simultaneously.…”
Section: A Optimization Algorithmsmentioning
confidence: 99%
See 2 more Smart Citations
“…Optimization algorithms translate the design problem into an abstract model and search for an optimal solution regarding specific aims and constraints. When applied to analog layout, suchlike approaches usually focus on one specific design step (particularly placement, as in [4] and [5], and routing, as in [6] and [7]) and its respective difficulties. Relatively few works, such as [8] and [9], deal with the challenge of handling these two heavily correlated tasks simultaneously.…”
Section: A Optimization Algorithmsmentioning
confidence: 99%
“…Amongst others, particular attention lies on abstract floorplan models such as TCG-S [4], sequence pairs [5], [9] and [10] and more enhanced representations [11]. Particular research effort is spent on the formal, explicit consideration of constraints.…”
Section: A Optimization Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…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] 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.…”
Section: A Previous Workmentioning
confidence: 99%
“…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 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(n 2 ) to O(n).…”
Section: A Previous Workmentioning
confidence: 99%