https://scholars.lib.ntu.edu.tw/handle/123456789/316481
標題: | Placement with symmetry constraints for analog layout design using TCG-S | 作者: | Lin, J.-M. Wu, G.-M. Chuang, J.-H. YAO-WEN CHANG |
公開日期: | 2005 | 卷: | 2 | 起(迄)頁: | 1135-1138 | 來源出版物: | Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC | 摘要: | 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 © 2005 IEEE. |
URI: | http://www.scopus.com/inward/record.url?eid=2-s2.0-84861419671&partnerID=MN8TOARS http://scholars.lib.ntu.edu.tw/handle/123456789/316481 |
SDG/關鍵字: | Polynomial approximation; Area utilization; Geometric relationships; Graph sequences; Module placement; Packing algorithms; Polynomial-time; Symmetry constraints; Transitive closure; Computer aided design |
顯示於: | 電子工程學研究所 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。