Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001最新文献

筛选
英文 中文
A graph based algorithm for optimal buffer insertion under accurate delay models 基于图的精确延迟模型下最优缓冲区插入算法
Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001 Pub Date : 2001-03-13 DOI: 10.1109/DATE.2001.915075
Youxin Gao, D. F. Wong
{"title":"A graph based algorithm for optimal buffer insertion under accurate delay models","authors":"Youxin Gao, D. F. Wong","doi":"10.1109/DATE.2001.915075","DOIUrl":"https://doi.org/10.1109/DATE.2001.915075","url":null,"abstract":"Buffer insertion is an efficient technique in interconnect optimization. This paper presents a graph based algorithm for optimal buffer insertion under accurate delay models. In our algorithm, a signal is accurately represented by a finite ramp which is characterized by two parameters, shift time and transition time. Any accurate delay model, such as delay models based on the transmission line model and SPICE simulations, can be incorporated into our algorithm. The algorithm determines the optimal number of buffers and their locations on a wire such that some optimization objective is satisfied. Two typical examples of such optimization objectives are minimizing the 50% threshold delay and minimizing the transition time. Both can be easily determined in our algorithm. We show that the buffer insertion problem can be reduced to a shortest path problem. The algorithm can be easily extended for simultaneous buffer insertion and wire-sizing, and complexity is still polynomial. The algorithm can also be extended to deal with problems such as buffer insertion subject to transition time constraints at any position along the wire.","PeriodicalId":424342,"journal":{"name":"Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001","volume":"49 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":"123085932","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}
引用次数: 20
Implementation of a linear histogram BIST for ADCs adc线性直方图BIST的实现
Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001 Pub Date : 2001-03-13 DOI: 10.1109/DATE.2001.915083
F. Azaïs, S. Bernard, Y. Bertrand, M. Renovell
{"title":"Implementation of a linear histogram BIST for ADCs","authors":"F. Azaïs, S. Bernard, Y. Bertrand, M. Renovell","doi":"10.1109/DATE.2001.915083","DOIUrl":"https://doi.org/10.1109/DATE.2001.915083","url":null,"abstract":"This paper validates a linear histogram BIST scheme for ADC testing. This scheme uses a time decomposition technique in order to minimize the required hardware circuitry. A practical implementation is described and the structure together with the operating mode of the different modules are detailed. Through this practical implementation, the performances and limitations of the proposed scheme are evaluated both in terms of additional circuitry and test time.","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":"125291188","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}
引用次数: 83
CPU for PlayStation(R)2 PlayStation(R)2的CPU
Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001 Pub Date : 2001-03-13 DOI: 10.1109/DATE.2001.915101
H. Tago, K. Hashimoto, N. Ikumi, M. Nagamatsu, M. Suzuoki, Y. Yamamoto
{"title":"CPU for PlayStation(R)2","authors":"H. Tago, K. Hashimoto, N. Ikumi, M. Nagamatsu, M. Suzuoki, Y. Yamamoto","doi":"10.1109/DATE.2001.915101","DOIUrl":"https://doi.org/10.1109/DATE.2001.915101","url":null,"abstract":"Processors designed for computer entertainment must perform 3D graphics calculations, especially geometry and perspective transformations. In the PlayStation(R)2, we introduced the new idea of synthesizing emotion called Emotion Synthesis and devised a new processor architecture to support its graphics demands. The architecture is embodied in the PlayStation(R)2's \"Emotion Engine\" CPU, which uses vector units (VUs) as the key units for floating-point calculations. Emotion synthesis means the real-time synthesis of a computer graphics animation scene that projects a great deal of atmosphere. For example, when a female character walks into a video game scene, her motion must be determined by solving physical equations in response to interactive events instead of replaying prerecorded data. Moreover, differential equations with a large number of variables must be used to describe, for example, the waving motions of her hair in a breeze. For authenticity in emotion synthesis, the CPU must execute these calculations in real time. \"Emotion Engine\" (\"EE\") is a system LSI including a 300 MHz 128-bit 2-way superscalar RISC core, two Vector Units (\"VU\"s), Image Processing Unit (\"IPU\") for MPEG-2 stream decode, a 10-channel memory access (DMA) controller, two channel Rambus(R) memory controller (RAC) and other peripheral modules. 13.5 M transistors are integrated on 15.02 mm/spl times/15.04 mm die with 0.25 /spl mu/m device technology with 0.18 /spl mu/m gate length. Design strategy and LSI design methodologies and CAD for \"Emotion Engine\" LSI are presented with emphasis on practical aspects of verification and timing closure. A combination of simulation, emulation and formal verification ensured the functional first silicon for system evaluation. In order to control wire delay in early design stage, floor-plan based synthesis and wire load estimation are adopted for quick timing closure.","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":"126832871","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}
引用次数: 0
Efficient and passive modeling of transmission lines by using differential quadrature method 利用微分正交法对传输线进行高效无源建模
Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001 Pub Date : 2001-03-13 DOI: 10.1109/DATE.2001.915060
Qinwei Xu, P. Mazumder
{"title":"Efficient and passive modeling of transmission lines by using differential quadrature method","authors":"Qinwei Xu, P. Mazumder","doi":"10.1109/DATE.2001.915060","DOIUrl":"https://doi.org/10.1109/DATE.2001.915060","url":null,"abstract":"This paper introduces a new transmission line modeling approach that employs an efficient numerical approximation technique called the differential quadrature method (DQM). The transmission line has been discretized and the approximation framework is constructed by using the fifth order differential quadrature method; consequently an improved discrete equivalent-circuit model is developed in the paper. The DQM-based modeling requires far fewer intervening grid points for building an accurate discrete model of the transmission line than numerical methods like FD requires. It introduces far less state variables than FD-based models; therefore, it has higher efficiency. The DQM technique can be integrated in a circuit simulator since it preserves the passivity.","PeriodicalId":424342,"journal":{"name":"Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001","volume":"12 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":"126938217","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}
引用次数: 1
A design strategy for low-voltage low-power continuous-time /spl Sigma//spl Delta/ A/D converters 低压低功率连续时间/spl Sigma//spl Delta/ A/D转换器的设计策略
Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001 Pub Date : 2001-03-13 DOI: 10.1109/DATE.2001.915050
F. Gerfers, Y. Manoli
{"title":"A design strategy for low-voltage low-power continuous-time /spl Sigma//spl Delta/ A/D converters","authors":"F. Gerfers, Y. Manoli","doi":"10.1109/DATE.2001.915050","DOIUrl":"https://doi.org/10.1109/DATE.2001.915050","url":null,"abstract":"This paper presents a design strategy for low-voltage low-power /spl Sigma//spl Delta/ analog-to-digital (A/D) converter using a continuous-time (CT) lowpass loop filter. An improved method is used to find the optimal /spl Sigma//spl Delta/ modulator implementation with respect to a minimal power consumption on the one hand and to fulfil a rapid prototyping approach on the other hand. The influence of the low supply voltage as well as circuit nonidealities on the overall /spl Sigma//spl Delta/ modulator is determined and verified by behavioral simulations. Transistor-level simulation results of a 1.5 V CT /spl Sigma//spl Delta/ A/D converter show a 75 dB dynamic range in a bandwidth of 25 kHz.","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":"128924601","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}
引用次数: 15
Optimal FPGA module placement with temporal precedence constraints 具有时间优先约束的最佳FPGA模块放置
Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001 Pub Date : 2001-03-13 DOI: 10.1109/DATE.2001.915093
S. Fekete, Ekkehard Köhler, J. Teich
{"title":"Optimal FPGA module placement with temporal precedence constraints","authors":"S. Fekete, Ekkehard Köhler, J. Teich","doi":"10.1109/DATE.2001.915093","DOIUrl":"https://doi.org/10.1109/DATE.2001.915093","url":null,"abstract":"We consider the optimal placement of hardware modules in space and time for FPGA architectures with reconfiguration capabilities, where modules are modeled as three-dimensional boxes in space and time. Using a graph-theoretic characterization of feasible packings, we are able to solve the following problems. (a) Find the minimal execution time of the given problem on an FPGA of fixed size, (b) Find the FPGA of minimal size to accomplish the tasks within a fired time limit. Furthermore, our approach is perfectly suited for the treatment of precedence constraints for the sequence of tasks, which are present in virtually all practical instances. Additional mathematical structures are developed that lead to a powerful framework for completing optimal solutions. The usefulness is illustrated by computational results.","PeriodicalId":424342,"journal":{"name":"Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001","volume":"51 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":"130358028","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}
引用次数: 120
MetaRTL: raising the abstraction level of RTL design mettartl:提高RTL设计的抽象层次
Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001 Pub Date : 2001-03-13 DOI: 10.1109/DATE.2001.915003
Jianwen Zhu
{"title":"MetaRTL: raising the abstraction level of RTL design","authors":"Jianwen Zhu","doi":"10.1109/DATE.2001.915003","DOIUrl":"https://doi.org/10.1109/DATE.2001.915003","url":null,"abstract":"The register transfer abstraction (RTL) has been established as the industrial standard for ASIC design, soft IP exchange and the backend interface for chip design at higher level. Unfortunately, the \"synthesizable\" VHDL/Verilog incarnation of the RTL abstraction has problems which prevent it from more productive use. For example, the confusion as the result of using simulation semantics for synthesis purpose, the lack of facility for component reuse at the \"protocol\" level, and the lack of memory abstraction. After a detailed discussion of these problems, this paper proposes a new RTL abstraction, called MetaRTL, which can be implemented by a modest extension to the traditional imperative programming languages. The productivity gain is further demonstrated by the description of a synthesis tool, called MetaSyn, which provides the \"added-value\". Experiments on the benchmark set show that MetaRTL is far more concise than the \"synthesizable\" HDL specification and incurs no overhead for synthesis result.","PeriodicalId":424342,"journal":{"name":"Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001","volume":"200 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":"121629314","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}
引用次数: 19
Extending lifetime of portable systems by battery scheduling 通过电池调度延长便携式系统的使用寿命
Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001 Pub Date : 2001-03-13 DOI: 10.1109/DATE.2001.915024
L. Benini, G. Castelli, A. Macii, E. Macii, M. Poncino, R. Scarsi
{"title":"Extending lifetime of portable systems by battery scheduling","authors":"L. Benini, G. Castelli, A. Macii, E. Macii, M. Poncino, R. Scarsi","doi":"10.1109/DATE.2001.915024","DOIUrl":"https://doi.org/10.1109/DATE.2001.915024","url":null,"abstract":"Multi-battery power supplies are becoming popular in electronic appliances of the latest generations, due to economical and manufacturing constraints. Unfortunately, a partitioned battery subsystem is not able to deliver the same amount of charge as a monolithic battery with the same total capacity. In this paper, we define the concept of battery scheduling, we investigate policies for solving the problem of optimal charge delivery, and we study the relationship of such policies with different configurations of the battery subsystem. Results, obtained for different workloads, demonstrate that the choice of the proper scheduling can make, in the best cease, system lifetime as close as 1% of that guaranteed by a monolithic battery of equal capacity.","PeriodicalId":424342,"journal":{"name":"Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001","volume":"117 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":"126330157","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}
引用次数: 73
Generating production quality software development tools using a machine description language 使用机器描述语言生成产品质量的软件开发工具
Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001 Pub Date : 2001-03-13 DOI: 10.1109/DATE.2001.915097
A. Hoffmann, A. Nohl, S. Pees, G. Braun, H. Meyr
{"title":"Generating production quality software development tools using a machine description language","authors":"A. Hoffmann, A. Nohl, S. Pees, G. Braun, H. Meyr","doi":"10.1109/DATE.2001.915097","DOIUrl":"https://doi.org/10.1109/DATE.2001.915097","url":null,"abstract":"This paper presents a methodology to automatically generate production quality software development tools for programmable architectures using the machine description language LISA. Various architectures presenting diverse architectural originalities will be presented and the feasibility of automatically generating simulator, assembler, linker and graphical debugger frontend are discussed. The presented approach is not limited to a fixed abstraction level-case studies of the Texas Instruments C62x and C54x, the Analog Devices ADSP2101 as well as the ARM7 show the applicability of the methodology from cycle/phase to instruction accurate models.","PeriodicalId":424342,"journal":{"name":"Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001","volume":"23 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":"130461007","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}
引用次数: 20
Special session on low-power systems on chips (SOCs) 低功耗片上系统(soc)专题会议
Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001 Pub Date : 2001-03-13 DOI: 10.1109/DATE.2001.915068
C. Piguet, M. Renaudin, T. Omnés
{"title":"Special session on low-power systems on chips (SOCs)","authors":"C. Piguet, M. Renaudin, T. Omnés","doi":"10.1109/DATE.2001.915068","DOIUrl":"https://doi.org/10.1109/DATE.2001.915068","url":null,"abstract":"For innovative portable products, Systems on Chips (SoCs) containing several processors, memories and specialised modules are obviously required. Performances but also low-power are main issues in the design of such SoCs. Are these low-power SoCs only constructed with low-power processors, memories and logic blocks? If the latter are unavoidable, many other issues are quite important for low-power SoCs, such as the way to synchronise the communications between processors as well as test procedures, online testing, software design and development tools. This paper is a general framework for the design of low-power SoCs, starting from the system level to the architecture level, assuming that the SoC is mainly based on the re-use of low-power processors, memories and logic peripherals. SoCs with many processors, co-processors, memories and peripherals cannot be synchronised with a single master clock, due to larger and larger wire delays in deep submicron technologies. Several clocking schemes have been proposed, such as GALS (Globally Asynchronous Locally Synchronous) but also full asynchronous architectures. This paper will present the advantages and disadvantages of these SoC clocking strategies as well as the impacts on low power. For embedded SoCs containing several processors, one has to write several pieces of software for each processor starting typically from a high-level specification using the C/C++ language. In order to tackle this problem, we propose to first transform the original specification by means of a systematic script of platform-independent source code transformations. That is illustrated by applying global loop transformation techniques to identify asynchronous partitions exhibiting little communication and high locality of access characteristics. In a second stage, we explore multiple-instruction multiple-data (MIMD) mapping onto a given (partly) predefined platform using advanced space-time analysis techniques to maintain low data transfer rates while achieving high system throughput. At the SoC level, accurate cost feedback including high-level power estimation is required. From this essential information, energy trade-offs between application sub-modules can for example be used to refine the solution further. In the case of mapping onto programmable cores with a shared memory hierarchy, a final refinement consists in reorganising the data layout for efficient cache utilisation.","PeriodicalId":424342,"journal":{"name":"Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001","volume":"13 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":"132185520","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}
引用次数: 10
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书