A novel encoding method into sequence-pair

C. Kodama, K. Fujiyoshi, Teppei Koga
{"title":"A novel encoding method into sequence-pair","authors":"C. Kodama, K. Fujiyoshi, Teppei Koga","doi":"10.1109/ISCAS.2004.1329529","DOIUrl":null,"url":null,"abstract":"The sequence-pair was proposed to represent a rectangle packing and a placement, and is used to place modules automatically in VLSI layout design. Several decoding methods of sequence-pair were proposed. However, encoding methods are not found except the original one called \"gridding\". The gridding requires almost O(n/sup 3/) time for a packing of n rectangular modules and it is hard to implement. Therefore, we propose a novel method to encode a given rectangle packing into a sequence-pair in O(n log n) time. We also propose a linear time method to obtain a sequence-pair from a given rectangular dissection represented by a Q-sequence, a recently proposed representation method of rectangular dissection. The proposed methods can be used for the compaction keeping topology, for example, in the post-process of the force directed relaxation, a method used in module placement, and so on.","PeriodicalId":6445,"journal":{"name":"2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)","volume":"20 1","pages":"V-V"},"PeriodicalIF":0.0000,"publicationDate":"2004-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCAS.2004.1329529","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

The sequence-pair was proposed to represent a rectangle packing and a placement, and is used to place modules automatically in VLSI layout design. Several decoding methods of sequence-pair were proposed. However, encoding methods are not found except the original one called "gridding". The gridding requires almost O(n/sup 3/) time for a packing of n rectangular modules and it is hard to implement. Therefore, we propose a novel method to encode a given rectangle packing into a sequence-pair in O(n log n) time. We also propose a linear time method to obtain a sequence-pair from a given rectangular dissection represented by a Q-sequence, a recently proposed representation method of rectangular dissection. The proposed methods can be used for the compaction keeping topology, for example, in the post-process of the force directed relaxation, a method used in module placement, and so on.
一种新的序列对编码方法
提出了用序列对表示矩形封装和布局的方法,用于超大规模集成电路(VLSI)布局设计中模块的自动布局。提出了几种序列对解码方法。然而,除了原始的“网格”编码方法外,没有找到其他编码方法。对于n个矩形模块的填充,网格化几乎需要O(n/sup 3/)时间,并且很难实现。因此,我们提出了一种在O(n log n)时间内将给定的矩形填充编码成序列对的新方法。我们还提出了一种线性时间法,从给定的由q序列表示的矩形剖分中获得序列对,这是最近提出的矩形剖分的表示方法。所提出的方法可用于压实保持拓扑,例如在力定向松弛的后处理中,在模块放置中使用的方法等。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信