The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
As restrições de simetria são as restrições de que as células fornecidas devem ser colocadas simetricamente no projeto de ICs analógicos. Usamos O-tree para representar posicionamentos e propomos um algoritmo de decodificação que pode obter um dos posicionamentos mínimos que satisfaçam as restrições. O algoritmo de decodificação usa programação linear, que consome muito tempo. Portanto, propomos um método baseado em gráfico para reconhecer se não existe nenhum posicionamento que satisfaça tanto a simetria dada quanto as restrições da árvore O, e usamos o método antes da aplicação da programação linear. A eficácia do método proposto foi demonstrada por experimentos computacionais.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Natsumi HIRAKAWA, Kunihiro FUJIYOSHI, "Placement with Symmetry Constraints for Analog IC Layout Design Based on Tree Representation" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 2, pp. 467-474, February 2009, doi: 10.1587/transfun.E92.A.467.
Abstract: Symmetry constrains are the constraints that the given cells should be placed symmetrically in design of analog ICs. We use O-tree to represent placements and propose a decoding algorithm which can obtain one of the minimum placements satisfying the constraints. The decoding algorithm uses linear programming, which is too much time consuming. Therefore we propose a graph based method to recognize if there exists no placement satisfying both the given symmetry and O-tree constraints, and use the method before application of linear programming. The effectiveness of the proposed method was shown by computational experiments.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.467/_p
Copiar
@ARTICLE{e92-a_2_467,
author={Natsumi HIRAKAWA, Kunihiro FUJIYOSHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Placement with Symmetry Constraints for Analog IC Layout Design Based on Tree Representation},
year={2009},
volume={E92-A},
number={2},
pages={467-474},
abstract={Symmetry constrains are the constraints that the given cells should be placed symmetrically in design of analog ICs. We use O-tree to represent placements and propose a decoding algorithm which can obtain one of the minimum placements satisfying the constraints. The decoding algorithm uses linear programming, which is too much time consuming. Therefore we propose a graph based method to recognize if there exists no placement satisfying both the given symmetry and O-tree constraints, and use the method before application of linear programming. The effectiveness of the proposed method was shown by computational experiments.},
keywords={},
doi={10.1587/transfun.E92.A.467},
ISSN={1745-1337},
month={February},}
Copiar
TY - JOUR
TI - Placement with Symmetry Constraints for Analog IC Layout Design Based on Tree Representation
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 467
EP - 474
AU - Natsumi HIRAKAWA
AU - Kunihiro FUJIYOSHI
PY - 2009
DO - 10.1587/transfun.E92.A.467
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2009
AB - Symmetry constrains are the constraints that the given cells should be placed symmetrically in design of analog ICs. We use O-tree to represent placements and propose a decoding algorithm which can obtain one of the minimum placements satisfying the constraints. The decoding algorithm uses linear programming, which is too much time consuming. Therefore we propose a graph based method to recognize if there exists no placement satisfying both the given symmetry and O-tree constraints, and use the method before application of linear programming. The effectiveness of the proposed method was shown by computational experiments.
ER -