{"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.