Placement with symmetry constraints for analog layout design using TCG-S

Jai Ming Lin; Guang Ming Wu; Yao Wen Chang; Jen-Hui Chuang

doi:10.1109/ASPDAC.2005.1466541

Placement with symmetry constraints for analog layout design using TCG-S

Jai Ming Lin^*, Guang Ming Wu, Yao Wen Chang, Jen-Hui Chuang

^*Corresponding author for this work

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

40 Scopus citations

Abstract

In order to handle device matching for analog circuits, some pairs of modules need to be placed symmetrically with respect to a common axis. In this paper, we deal with the module placement with symmetry constraints for analog design using the Transitive Closure Graph-Sequence (TCG-S) representation. Since the geometric relationships of modules are transparent to TCG-S and its induced operations, TCG-S has better flexibility than previous works in dealing with symmetry constraints. We first propose the necessary and sufficient conditions of TCG-S for symmetry modules. Then, we propose a polynomial-time packing algorithm for a TCG-S with symmetry constraints. Experimental results show that the TCG-S based algorithm results in the best area utilization. I

Original language	English
Title of host publication	Proceedings of the 2005 Asia and South Pacific Design Automation Conference, ASP-DAC 2005
Pages	1135-1138
Number of pages	4
DOIs	https://doi.org/10.1109/ASPDAC.2005.1466541
State	Published - 1 Dec 2005
Event	2005 Asia and South Pacific Design Automation Conference, ASP-DAC 2005 - Shanghai, China Duration: 18 Jan 2005 → 21 Jan 2005

Publication series

Name	Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC
Volume	2

Conference

Conference	2005 Asia and South Pacific Design Automation Conference, ASP-DAC 2005
Country	China
City	Shanghai
Period	18/01/05 → 21/01/05

Access to Document

10.1109/ASPDAC.2005.1466541

Link to publication in Scopus

Fingerprint Dive into the research topics of 'Placement with symmetry constraints for analog layout design using TCG-S'. Together they form a unique fingerprint.

Cite this

Lin, J. M., Wu, G. M., Chang, Y. W., & Chuang, J-H. (2005). Placement with symmetry constraints for analog layout design using TCG-S. In Proceedings of the 2005 Asia and South Pacific Design Automation Conference, ASP-DAC 2005 (pp. 1135-1138). [1466541] (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC; Vol. 2). https://doi.org/10.1109/ASPDAC.2005.1466541

@inproceedings{19b35c398ce548669f88bbd13ac56860,

title = "Placement with symmetry constraints for analog layout design using TCG-S",

abstract = "In order to handle device matching for analog circuits, some pairs of modules need to be placed symmetrically with respect to a common axis. In this paper, we deal with the module placement with symmetry constraints for analog design using the Transitive Closure Graph-Sequence (TCG-S) representation. Since the geometric relationships of modules are transparent to TCG-S and its induced operations, TCG-S has better flexibility than previous works in dealing with symmetry constraints. We first propose the necessary and sufficient conditions of TCG-S for symmetry modules. Then, we propose a polynomial-time packing algorithm for a TCG-S with symmetry constraints. Experimental results show that the TCG-S based algorithm results in the best area utilization. I",

author = "Lin, {Jai Ming} and Wu, {Guang Ming} and Chang, {Yao Wen} and Jen-Hui Chuang",

year = "2005",

month = dec,

day = "1",

doi = "10.1109/ASPDAC.2005.1466541",

language = "English",

isbn = "0780387368",

series = "Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC",

pages = "1135--1138",

booktitle = "Proceedings of the 2005 Asia and South Pacific Design Automation Conference, ASP-DAC 2005",

note = "null ; Conference date: 18-01-2005 Through 21-01-2005",

}

Lin, JM, Wu, GM, Chang, YW & Chuang, J-H 2005, Placement with symmetry constraints for analog layout design using TCG-S. in Proceedings of the 2005 Asia and South Pacific Design Automation Conference, ASP-DAC 2005., 1466541, Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC, vol. 2, pp. 1135-1138, 2005 Asia and South Pacific Design Automation Conference, ASP-DAC 2005, Shanghai, China, 18/01/05. https://doi.org/10.1109/ASPDAC.2005.1466541

Placement with symmetry constraints for analog layout design using TCG-S. / Lin, Jai Ming; Wu, Guang Ming; Chang, Yao Wen; Chuang, Jen-Hui.

Proceedings of the 2005 Asia and South Pacific Design Automation Conference, ASP-DAC 2005. 2005. p. 1135-1138 1466541 (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Placement with symmetry constraints for analog layout design using TCG-S

AU - Lin, Jai Ming

AU - Wu, Guang Ming

AU - Chang, Yao Wen

AU - Chuang, Jen-Hui

PY - 2005/12/1

Y1 - 2005/12/1

N2 - In order to handle device matching for analog circuits, some pairs of modules need to be placed symmetrically with respect to a common axis. In this paper, we deal with the module placement with symmetry constraints for analog design using the Transitive Closure Graph-Sequence (TCG-S) representation. Since the geometric relationships of modules are transparent to TCG-S and its induced operations, TCG-S has better flexibility than previous works in dealing with symmetry constraints. We first propose the necessary and sufficient conditions of TCG-S for symmetry modules. Then, we propose a polynomial-time packing algorithm for a TCG-S with symmetry constraints. Experimental results show that the TCG-S based algorithm results in the best area utilization. I

AB - In order to handle device matching for analog circuits, some pairs of modules need to be placed symmetrically with respect to a common axis. In this paper, we deal with the module placement with symmetry constraints for analog design using the Transitive Closure Graph-Sequence (TCG-S) representation. Since the geometric relationships of modules are transparent to TCG-S and its induced operations, TCG-S has better flexibility than previous works in dealing with symmetry constraints. We first propose the necessary and sufficient conditions of TCG-S for symmetry modules. Then, we propose a polynomial-time packing algorithm for a TCG-S with symmetry constraints. Experimental results show that the TCG-S based algorithm results in the best area utilization. I

UR - http://www.scopus.com/inward/record.url?scp=84861419671&partnerID=8YFLogxK

U2 - 10.1109/ASPDAC.2005.1466541

DO - 10.1109/ASPDAC.2005.1466541

M3 - Conference contribution

AN - SCOPUS:84861419671

SN - 0780387368

SN - 9780780387362

T3 - Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

SP - 1135

EP - 1138

BT - Proceedings of the 2005 Asia and South Pacific Design Automation Conference, ASP-DAC 2005

Y2 - 18 January 2005 through 21 January 2005

ER -