{"title":"Chip-package codesign-challenges and directions","authors":"P. Franzon","doi":"10.1109/ASPDAC.1999.760047","DOIUrl":"https://doi.org/10.1109/ASPDAC.1999.760047","url":null,"abstract":"Increasingly the package, and associated discretes, contribute critically to the overall circuit performance, rather than just providing a connection function. These performance issues are critical today and are fast becoming more complex than current CAD tool trends will be able to support. For example, in today's digital systems, the package design is an important part of the signal integrity equation, and a major determinant of board routing costs. The concentration is on signal integrity management. However, in tomorrow's systems, the promise of high density packaging presents novel integration opportunities that will require new design approaches beyond just managing signal integrity; other connectivity and performance issues will enter into play. For today's RF and analog systems, the package is part of the load and antenna environment and again presents a difficult signal integrity analysis. In tomorrow's systems, new technologies and higher performance/frequency requirements will require system modeling solutions far superior to those offered today. In both types of systems, the package design is starting to require the sophistication normally reserved for the IC design. It is time for the packaging CAD tools to recognize this trend and prepare for it. The author reviews these system design trends and gives examples from work performed at NCSU and elsewhere. He also presents the state of the art for CAD support for chip-package codesign and postulates that the continuation of current trends will not give satisfactory solutions for future systems. It is argued that a new approach is needed, one hinging on codesigning the package, chip and system in a unified chip-centric environment while maintaining suitable levels of abstraction to permit interaction across inter-disciplinary teams.","PeriodicalId":201352,"journal":{"name":"Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127746055","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The hierarchical h-adaptive 3-D boundary element computation of VLSI interconnect capacitance","authors":"Jinsong Hou, Zeyi Wang, Xianlong Hong","doi":"10.1109/ASPDAC.1999.759719","DOIUrl":"https://doi.org/10.1109/ASPDAC.1999.759719","url":null,"abstract":"In deep submicron VLSI circuits, the interconnect parasitic capacitance is a very important factor determining circuit performances such as power and time-delay. The Boundary Element Method (BEM) is an effective tool for solving Laplacian's equation applied in the parasitic capacitance extraction. In this paper, a hierarchical h-adaptive BEM is presented. It constructs a 3-D linear hierarchical shape function based on a constant boundary element and uses previous computations and solutions. Hence, it reduces computation significantly in the adaptive procedure. Besides, a combination of a residual-type estimator and reduced Z-Z error estimator for more reliable and efficient estimation of error is presented. Some numerical results show that this method is effective.","PeriodicalId":201352,"journal":{"name":"Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127811865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Faster and better spectral algorithms for multi-way partitioning","authors":"Jan-Yang Chang, Yu-Chen Liu, Ting-Chi Wang","doi":"10.1109/ASPDAC.1999.759715","DOIUrl":"https://doi.org/10.1109/ASPDAC.1999.759715","url":null,"abstract":"In this paper two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the scaled cost. The problem can be approximately transformed into the vector partitioning problem by mapping each circuit component to a multi-dimensional vector. The common key idea of our two algorithms for solving the vector partitioning problem is to first treat the set of vectors as a cluster; and then repeatedly select a cluster which gives the maximum cost improvement among all the current clusters, and partition it into two new clusters. The bipartitioning process is continued until the number of clusters is equal to the required number of partitions. The experimental results indicate that the two algorithms significantly outperform MELO+DP-RP [3] in both the run time and partitioning result.","PeriodicalId":201352,"journal":{"name":"Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198)","volume":"7 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132503344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Li Jiang, Dongju Li, Shintaro Haba, C. Honsawek, H. Kunieda
{"title":"Motion estimator LSI for MPEG2 high level standard","authors":"Li Jiang, Dongju Li, Shintaro Haba, C. Honsawek, H. Kunieda","doi":"10.1109/ASPDAC.1999.759705","DOIUrl":"https://doi.org/10.1109/ASPDAC.1999.759705","url":null,"abstract":"In this design, a dedicated motion estimation LSI of MPEG2 is presented. Combining the bits truncation adaptive pyramid (BTAP) algorithm with Window-MSPA architecture as well as by using custom cell and full custom design methods the chip size becomes 4.8 mm/spl times/4.8 mm with 0.5 /spl mu/m 2-level-metal CMOS technology. The test chip which works at 41.5 MHz, possesses a search range of /spl plusmn/67 for image size of 1920/spl times/1152 and achieves video rate of 30 fields/s.","PeriodicalId":201352,"journal":{"name":"Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132508012","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Mutoh, S. Shigematsu, Yoshinori Gotoh, S. Konaka
{"title":"Design method of MTCMOS power switch for low-voltage high-speed LSIs","authors":"S. Mutoh, S. Shigematsu, Yoshinori Gotoh, S. Konaka","doi":"10.1109/ASPDAC.1999.759726","DOIUrl":"https://doi.org/10.1109/ASPDAC.1999.759726","url":null,"abstract":"The design of the power switch which turns on and off the power supply to the logic gates is essential to low-voltage high-speed circuit techniques such as multi-threshold voltage CMOS (MTCMOS). This is because this switch influences the speed, area, and power of a low-voltage LSI. This paper describes the influences of the power switch on the circuit performance in detail, and proposes a systematic method for designing a power switch which takes them into consideration for the first time. The main feature of this method, called the average-current method, is the use of the average current consumed in an LSI to determine the power-switch size. This makes it easy for designers to determine the minimum size of the power-switch needed to satisfy the required speed, which results in minimizing the area penalty and the standby power. Useful analytical formula and the practical determination flow are also described. Measurement of an actual 0.25 /spl mu/m MTCMOS/SIMOX 290-Kgate LSI operating at 1 V confirmed the effectiveness of this method. This method estimated well the required power-switch width, and as a result it reduced the area penalty and standby current by about 80% compared to the conventional design scheme.","PeriodicalId":201352,"journal":{"name":"Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198)","volume":"47 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132939674","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A clustering based linear ordering algorithm for K-way spectral partitioning","authors":"Shiuann-Shiuh Lin, Wen-Hsin Chen, Wen-Wei Lin, TingTing Hwang","doi":"10.1109/ASPDAC.1999.759714","DOIUrl":"https://doi.org/10.1109/ASPDAC.1999.759714","url":null,"abstract":"The spectral method can lead to a high quality of multi-way partition due to its ability to capture global netlist information. For spectral partition, n netlist modules are mapped to n points in d-dimensional space, and then a linear ordering of these n modules is constructed to be used as a basis for partitioning. In this paper, we propose two clustering based linear ordering algorithms taking into consideration the objective function presented.","PeriodicalId":201352,"journal":{"name":"Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133172077","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A new global routing algorithm independent of net ordering","authors":"Haiyun Bao, Xianlong Hong, Yici Cai","doi":"10.1109/ASPDAC.1999.760006","DOIUrl":"https://doi.org/10.1109/ASPDAC.1999.760006","url":null,"abstract":"We proposed a new global routing algorithm solving the net ordering problem. The algorithm uses random optimization methods to keep the equality of earlier routed nets and later routed nets in passing congested areas. It can find a solution independent of net ordering in short time. A global router is implemented in this method. Experiments show that the router performs much faster than Matula router while obtaining solutions with approximate quality.","PeriodicalId":201352,"journal":{"name":"Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116433620","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimal wire shape with consideration of coupling capacitance under Elmore delay model","authors":"Youxin Gao, D. F. Wong","doi":"10.1109/ASPDAC.1999.759999","DOIUrl":"https://doi.org/10.1109/ASPDAC.1999.759999","url":null,"abstract":"In this paper, by using calculus of variations, we determine the optimal shape for a wire under the Elmore delay model. Coupling capacitance has been taken into consideration explicitly by treating it as another source of grounded capacitance. Given two wires in parallel, one has uniform width and the other has non-uniform width whose shape is described by a function f(x). Let T/sub D/ be the delay through the non-uniform wire. We determine f(x) such that T/sub D/ is minimized. We also extend our study to the case where a non-uniform wire has two neighboring wires. Our study shows that the optimal shape function satisfies an integral equation. Numerical methods are employed to solve the corresponding differential equation and carry out the integration. We provide an efficient algorithm to find the optimal solution. Experiments show that it only takes several iterations to get the optimal results by using our algorithm. Our experiments also show that the wire delay T/sub D/ is a convex function of the wire width at the driver end.","PeriodicalId":201352,"journal":{"name":"Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127486576","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Electronics development of silicon microdisplay for virtual reality applications","authors":"P. Cheng, H. C. Huang","doi":"10.1109/ASPDAC.1999.759994","DOIUrl":"https://doi.org/10.1109/ASPDAC.1999.759994","url":null,"abstract":"We have developed a highly integrated liquid-crystal-on-silicon microdisplay for virtual reality applications. The silicon display panel was designed and fabricated by a custom 0.5 /spl mu/m 3-metal CMOS technology. We further utilized field programmable gate array to implement a color sequential technique for driving this display panel. 4 bits per color of the display was demonstrated. The use of FPGA has advantages of fast prototyping and flexible in-circuit reconfiguration for different display applications. This compact microdisplay system can lead to a variety of virtual reality applications.","PeriodicalId":201352,"journal":{"name":"Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125271193","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A new single-clock flip-flop for half-swing clocking","authors":"Young-Su Kwon, Bong-Il Park, I. Park, C. Kyung","doi":"10.1109/ASPDAC.1999.759727","DOIUrl":"https://doi.org/10.1109/ASPDAC.1999.759727","url":null,"abstract":"We propose a new flip-flop configuration which saves about 60% of total clocking power using a half-swing clock. To use the half-swing clock, level converters or special clock drivers are traditionally required and the power consumptions of this logic cannot be ignored. In the proposed scheme, only NMOS devices are clocked with a half-swing clock in order to make it operate without the level converter or any other additional logics, and the random logic circuits except for the clock and flip-flops are supplied by V/sub cc/ while the clock network is supplied by V/sub cc//2. Compared to the conventional scheme, a great amount of power consumed in clocking which is responsible for a large portion of total chip power can be saved with the proposed new flip-flop configuration.","PeriodicalId":201352,"journal":{"name":"Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198)","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114300947","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}