{"title":"Modeling electromagnetic emission of integrated circuits for system analysis","authors":"P. Kralicek, W. John, H. Garbe","doi":"10.1109/DATE.2001.915046","DOIUrl":"https://doi.org/10.1109/DATE.2001.915046","url":null,"abstract":"In this contribution a new methodology for modeling electromagnetic emission of integrated circuits in system analysis is shown. By using a physical model based on a multipole expansion, the emitted fields can be well approximated in the space outside a component. This allows a convenient representation with a low number of model parameters which can be determined by measurement or simulation. To show the applicability, the developed models are used in a system level printed circuit board simulator. The results are compared with reference calculations.","PeriodicalId":424342,"journal":{"name":"Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126497470","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":"Efficient time-domain simulation of telecom frontends using a complex damped exponential signal model","authors":"P. Vanassche, G. Gielen, W. Sansen","doi":"10.1109/DATE.2001.915020","DOIUrl":"https://doi.org/10.1109/DATE.2001.915020","url":null,"abstract":"This paper presents an efficient time-domain simulation approach for telecommunication frontends at architectural level. It is based upon the use of complex damped exponential modeling functions. These allow to construct accurate signal models for digitally modulated telecom signals, requiring only few modeling functions. Since these models are valid over a long range of time, they allow for a large timestep, which greatly speeds up time-domain simulation of the telecom frontends. Details of a simulation approach based upon this signal model are discussed. The approach is verified by experimental results.","PeriodicalId":424342,"journal":{"name":"Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121223429","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":"SH-4 RISC microprocessor for multimedia, game machine","authors":"S. Narita","doi":"10.1109/DATE.2001.915103","DOIUrl":"https://doi.org/10.1109/DATE.2001.915103","url":null,"abstract":"The SH-4 is a 2-issue superscalar 32-bit RISC microprocessor for SEGA's game machine, Dreamcast. In order to extend the floating-point performance, a graphic FPU and graphic-oriented instructions are provided. The performance is 360 VAX MIPS, 6.0 M Polygons/sec, 1.4 G FLOPS (peak with the new instructions) at 200 MHz.","PeriodicalId":424342,"journal":{"name":"Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121454311","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":"Static memory allocation by pointer analysis and coloring","authors":"Jianwen Zhu","doi":"10.1109/DATE.2001.915121","DOIUrl":"https://doi.org/10.1109/DATE.2001.915121","url":null,"abstract":"Modern systems-on-chips often allocate more silicon real-estate to memory than logic. The minimization of on-chip memory becomes increasingly important for the reduction of manufacturing cost. In this paper, we present a new technique that minimizes memory usage. Incorporated in a behavioral synthesis tool that synthesizes general-purpose C programs, this technique is fully automated and does not rely on users to explicitly specify dataflow information. Experimental results show that significant improvements can be achieved for the benchmark set.","PeriodicalId":424342,"journal":{"name":"Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132364645","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":"Spectral decision diagrams using graph transformations","authors":"M. Thornton, R. Drechsler","doi":"10.1109/DATE.2001.915106","DOIUrl":"https://doi.org/10.1109/DATE.2001.915106","url":null,"abstract":"Spectral techniques are powerful methods for synthesis and verification of digital circuits. The advances in DD representations for discrete valued functions in terms of computational efficiency can be exploited in the calculation of the spectra of Boolean functions. The classical approach in computing the spectrum of a function by taking advantage of factored transformation matrices as used in the FFT may be reformulated in terms of DD based graph algorithms resulting in a complete representation of the spectrum. The relationship between DD based interpretations and the linear algebra based definitions of spectral methods are described.","PeriodicalId":424342,"journal":{"name":"Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133762046","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":"Biasing symbolic search by means of dynamic activity profiles","authors":"G. Cabodi, P. Camurati, S. Quer","doi":"10.1109/DATE.2001.914993","DOIUrl":"https://doi.org/10.1109/DATE.2001.914993","url":null,"abstract":"We address BDD based reachability analysis, which is the core technique of symbolic sequential verification and Model Checking. Within this framework, non purely breadth-first and guided traversals have shown their value to improve efficiency by reducing memory consumption for BDD representation. We propose a guided search strategy exploiting performance statistics. These activity figures are gathered through a continuous and dynamic learning process on a variable-by-variable basis. This technique is currently integrated with the reachability analysis routine, as it is fully compatible with dynamic reordering and allows multiple partial traversal phases. We thus move away from the static and manual schemes, which are one of the main limitations of previous approaches. Experiments are given to demonstrate the efficiency and robustness of the approach.","PeriodicalId":424342,"journal":{"name":"Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124928434","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":"Explicit formulas and efficient algorithm for moment computation of coupled RC trees with lumped and distributed elements","authors":"Qingjian Yu, E. Kuh","doi":"10.1109/DATE.2001.915061","DOIUrl":"https://doi.org/10.1109/DATE.2001.915061","url":null,"abstract":"In today's deep submicron technology the coupling capacitances among individual on-chip RC trees have an essential effect on the signal delay and crosstalk, and the interconnects should be modeled as coupled RC trees. We provide simple explicit formulas for the Elmore delay and higher order voltage moments, and a linear order recursive algorithm for the voltage moment computation for lumped and distributed coupled RC trees. By using the formulas and algorithms, the moment matching method can be efficiently implemented to deal with delay and crosstalk estimation, model order reduction and optimal design of interconnects.","PeriodicalId":424342,"journal":{"name":"Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132218985","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 decade of reconfigurable computing: a visionary retrospective","authors":"R. Hartenstein","doi":"10.1109/DATE.2001.915091","DOIUrl":"https://doi.org/10.1109/DATE.2001.915091","url":null,"abstract":"The paper surveys a decade of R&D on coarse grain reconfigurable hardware and related CAD, points out why this emerging discipline is heading toward a dichotomy of computing science, and advocates the introduction of a new soft machine paradigm to replace CAD by compilation.","PeriodicalId":424342,"journal":{"name":"Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133892396","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":"High-quality sub-function construction in functional decomposition based on information relationship measures","authors":"L. Józwiak, A. Chojnacki","doi":"10.1109/DATE.2001.915053","DOIUrl":"https://doi.org/10.1109/DATE.2001.915053","url":null,"abstract":"Functional decomposition seems to be the most effective circuit synthesis approach for look-up table (LUT) FPGAs, (C)PLDs and complex gates. In the functional decomposition that targets LUT FPGAs, the circuit is constructed by recursively decomposing a given function and its sub-functions until each of the resulting sub-functions can be directly implemented with a LUT. The choice of sub-functions constructed in this process decides the quality of the resulting multi-level circuit expressed in terms of the logic block count and speed. In this paper, we propose a new effective and efficient method for the sub-function construction, and we consider its application in our circuit synthesis tool that targets LUT-based FPGAs. The method is based on the information relationship measures. The experimental results demonstrate that the proposed approach leads to extremely fast and very small circuits.","PeriodicalId":424342,"journal":{"name":"Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001","volume":"293 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116423863","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":"Towards a better understanding of failure modes and test requirements of ADCs","authors":"A. Lechner, A. Richardson, B. Hermes","doi":"10.1109/DATE.2001.915129","DOIUrl":"https://doi.org/10.1109/DATE.2001.915129","url":null,"abstract":"It is now widely recognised that Built-in Self-Test (BIST) techniques and Design-for-Testability (DfT) will be mandatory to meet test and quality specifications in next generation mixed signal ICs. For evaluating, verifying, and comparing testability improvements, a more detailed understanding of circuit specific failure modes is essential. This paper presents fault simulation results for a 6-bit ADC and identifies typical failure modes the converter is likely to exhibit and hence must be tested for.","PeriodicalId":424342,"journal":{"name":"Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114652260","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}