Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96最新文献

筛选
英文 中文
Overcoming chip-to-chip delays and clock skews 克服芯片间延迟和时钟偏差
G. Even, A. Litman
{"title":"Overcoming chip-to-chip delays and clock skews","authors":"G. Even, A. Litman","doi":"10.1109/ASAP.1996.542815","DOIUrl":"https://doi.org/10.1109/ASAP.1996.542815","url":null,"abstract":"In general, mapping a circuit onto several chips incurs a physical setting which differs from those within a chip. Specifically, the delay of chip-to-chip interconnections is much longer than on-chip delays of wires and gates. This delay effects the bandwidth as well. In addition, the clock skew between chips is larger than the clock skew within a chip. One may mistakenly conclude that the feasible clock period of a systolic array cannot be smaller than the maximal delay of an interconnection in a realization of the circuit. This paper proposes a technique for mapping large systolic linear arrays and systolic two-dimensional arrays onto several chips while almost maintaining the clock rates which are obtainable when these circuits are small enough to fit into a single chip. Our solution does not rely on special analogue techniques. It is described in a sequence of transformations (logic duplication and retiming), reductions, and an implementation of interconnections which have a required behavior in a given physical setting. It is shown that each step preserves functionality, and subsequently, the correctness of the proposed solution is implied.","PeriodicalId":397756,"journal":{"name":"Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115234393","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
An architectural design for parallel fractal compression 并行分形压缩的结构设计
K. Acken, Heung-Nam Kim, M. J. Irwin, R. Owens
{"title":"An architectural design for parallel fractal compression","authors":"K. Acken, Heung-Nam Kim, M. J. Irwin, R. Owens","doi":"10.1109/ASAP.1996.542796","DOIUrl":"https://doi.org/10.1109/ASAP.1996.542796","url":null,"abstract":"Fractal image compression has many features that makes it a powerful compression scheme, but it has been mainly restricted to archival storage due to its time consuming encoding algorithm. In this paper, we take a known quad-tree fractal encoding algorithm and design an ASIC parallel image processing array that can encode reasonably sized gray-scale images in real-time. In designing this architecture, we include novel optimizations that result in speed improvements at the algorithmic, architectural, and circuit levels.","PeriodicalId":397756,"journal":{"name":"Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130876397","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
A novel matching criterion and low power architecture for real-time block based motion estimation 一种新的匹配准则和低功耗的实时块运动估计体系结构
Hangu Yeo, Y. Hu
{"title":"A novel matching criterion and low power architecture for real-time block based motion estimation","authors":"Hangu Yeo, Y. Hu","doi":"10.1109/ASAP.1996.542807","DOIUrl":"https://doi.org/10.1109/ASAP.1996.542807","url":null,"abstract":"In recent years, minimizing the power consumption has become a key issue in the design of portable electronic devices. In this paper, low power architecture which can support the real time motion estimation of video signals is presented. The architecture is based on a binary level matching criterion which performs a bit-wise comparison. The processor level design based on simple combinational logic using the binary level matching criterion has been introduced. Compared with the existing architectures, the proposed architecture delivers higher throughput rate, requires fewer input/output lines, and reduces the total power consumption.","PeriodicalId":397756,"journal":{"name":"Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126654480","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
Finite word-length effects of an unified systolic array for 2-D DCT/IDCT 二维DCT/IDCT统一收缩阵列的有限字长效应
Hyesook Lim, Changhoon Yim, E. Swartzlander
{"title":"Finite word-length effects of an unified systolic array for 2-D DCT/IDCT","authors":"Hyesook Lim, Changhoon Yim, E. Swartzlander","doi":"10.1109/ASAP.1996.542799","DOIUrl":"https://doi.org/10.1109/ASAP.1996.542799","url":null,"abstract":"This paper presents a fixed-point error analysis for the unified systolic array implementation of 2-dimensional (2-D) discrete cosine transform (DCT) and 2-D inverse discrete cosine transform (IDCT). Closed form expressions for the mean and variance of fixed-point rounding-errors and truncation-errors are derived. Simulation results are provided to verify the analysis. Simulations designed to find the minimum word-length which satisfies IEEE requirements for the implementation of an 8/spl times/8 IDCT are also performed. Simulation results show that the proposed systolic array is more robust for the fixed-point error than other existing implementations for DCT/IDCT.","PeriodicalId":397756,"journal":{"name":"Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131359512","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}
引用次数: 3
High-speed Viterbi decoder: an efficient scheduling method to exploit the pipelining 高速维特比解码器:一种利用流水线的高效调度方法
M. Bóo, Francisco Argüello, J. Bruguera, E. Zapata
{"title":"High-speed Viterbi decoder: an efficient scheduling method to exploit the pipelining","authors":"M. Bóo, Francisco Argüello, J. Bruguera, E. Zapata","doi":"10.1109/ASAP.1996.542811","DOIUrl":"https://doi.org/10.1109/ASAP.1996.542811","url":null,"abstract":"The main part of the Viterbi algorithm is a nonlinear feedback loop which presents a bottleneck for high-speed implementations. We present a novel scheduling scheme that allows increasing the available speed of the system. This is done through the utilization of look-ahead techniques to compute non-sequential data and, in this way, break the recursivity of the algorithm. This permits introducing pipelining. As a result, we obtain a speed growth comparable to previous parallel solutions, but with less hardware cost.","PeriodicalId":397756,"journal":{"name":"Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121259209","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}
引用次数: 2
A decomposition method for efficient use of distributed supercomputers for finite element applications 一种有效利用分布式超级计算机进行有限元应用的分解方法
V. Taylor, Jing Chen, T. Canfield, R. Stevens
{"title":"A decomposition method for efficient use of distributed supercomputers for finite element applications","authors":"V. Taylor, Jing Chen, T. Canfield, R. Stevens","doi":"10.1109/ASAP.1996.542797","DOIUrl":"https://doi.org/10.1109/ASAP.1996.542797","url":null,"abstract":"The interconnection of geographically distributed supercomputers via highspeed networks makes available the needed compute power for large-scale scientific applications, such as finite element applications. In this paper we propose a two-level data decomposition method for efficient execution of finite element applications on a network of supercomputers. Our method exploits the following features that may be different for each supercomputer in the system: processor speed, number of processors used from each supercomputer, local network performance, wide area network performance and wide area topology. Preliminary experiments involving a nonlinear, finite element application executed on a network of two supercomputers, one located at Argonne National Laboratory and the other one at the Cornell Theory Center, demonstrate a 20% reduction in execution time when the proposed decomposition is used as compared with naively applying conventional decompositions that are applicable to single supercomputers.","PeriodicalId":397756,"journal":{"name":"Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116801780","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}
引用次数: 7
A common architecture for the DWT and IDWT DWT和IDWT的通用体系结构
M. Vishwanath, R. Owens
{"title":"A common architecture for the DWT and IDWT","authors":"M. Vishwanath, R. Owens","doi":"10.1109/ASAP.1996.542814","DOIUrl":"https://doi.org/10.1109/ASAP.1996.542814","url":null,"abstract":"This paper presents an architecture which is equally efficient at computing both the discrete wavelet transform (the DWT) and the inverse discrete wavelet transform (the IDWT). Given the seemingly fundamental difference between the structure of a DWT filter bank and the structure of an IDWT filter bank, it is somewhat surprising that such an architecture can be derived. Our architecture allows the building of a single chip which can efficiently compute both transforms. Tandem use of the architecture (/spl rarr/DWT/spl rarr/IDWT/spl rarr/) is simplified by the fact that the j'th octave is generated by the architecture when it is in DWT mode at the sane rate at which it is consumed by the architecture when it is in IDWT mode.","PeriodicalId":397756,"journal":{"name":"Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125245904","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
Architectural optimizations for a floating point multiply-accumulate unit in a graphics pipeline 图形管道中浮点乘法累加单元的体系结构优化
K. Acken, M. J. Irwin, R. Owens, A. Garga
{"title":"Architectural optimizations for a floating point multiply-accumulate unit in a graphics pipeline","authors":"K. Acken, M. J. Irwin, R. Owens, A. Garga","doi":"10.1109/ASAP.1996.542802","DOIUrl":"https://doi.org/10.1109/ASAP.1996.542802","url":null,"abstract":"Scientific visualization and virtual reality have pushed three-dimensional graphics engines to their limits for updating scenes in real-time. One bottleneck of graphic systems is the transformation of an object's vertices into normalized space based on an evaluated transformation stack. This operation as often done in floating point, requiring a fast floating point multiply-accumulate unit. This paper presents architectural optimizations to a graphics pipeline floating point multiply-accumulate unit by using block floating point and parallelism to bypass or merge trivial operations in the matrix multiplications.","PeriodicalId":397756,"journal":{"name":"Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133723523","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}
引用次数: 7
Monitoring and debugging a hard real-time distributed computer for aircraft industry 飞机工业硬实时分布式计算机的监控与调试
N. Hubart
{"title":"Monitoring and debugging a hard real-time distributed computer for aircraft industry","authors":"N. Hubart","doi":"10.1109/ASAP.1996.542812","DOIUrl":"https://doi.org/10.1109/ASAP.1996.542812","url":null,"abstract":"Distributed systems offer efficient solutions to answer the requirements of embedded computers for aircraft industry. Indeed, performances and reliability can be considerably increased compared with existing computers. Today, such computers often rely on massively redundant architectures, but distributed architectures seem to be a great challenge for the aeronautic community. In this paper, we show the main advantages of distributed architectures and we describe which techniques can be used to get round their drawbacks when they are used for critical applications. To illustrate the overall characteristics of this future generation of systems, we present our new distributed control computer answering to aeronautical specifications, such as deterministic behaviour, fault-tolerance, powerful monitoring facilities for debug and maintenance.","PeriodicalId":397756,"journal":{"name":"Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127555753","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
A synthesis system for bus-based wavefront array architectures 基于总线的波前阵列结构的综合系统
R. Hartenstein, J. Becker, M. Herz, R. Kress, U. Nageldinger
{"title":"A synthesis system for bus-based wavefront array architectures","authors":"R. Hartenstein, J. Becker, M. Herz, R. Kress, U. Nageldinger","doi":"10.1109/ASAP.1996.542822","DOIUrl":"https://doi.org/10.1109/ASAP.1996.542822","url":null,"abstract":"A datapath synthesis system (DPSS) for a bus-based wavefront array architecture, called rDPA (reconfigurable datapath architecture), is presented. An internal data bus to the array simplifies the access of the processing elements for data manipulations. The DPSS allows automatic mapping of high level datapath structures onto the rDPA without manual interaction. Optimization techniques are sketched. The rDPA is scalable to arbitrarily large arrays and reconfigurable to be adaptable to the computational problem. Fine grained parallelism is achieved by using simple reconfigurable processing elements which are called datapath units (DPUs). The rDPA can be used as a reconfigurable ALU in transport-triggered architectures as well as for rapid prototyping of high speed datapaths.","PeriodicalId":397756,"journal":{"name":"Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96","volume":"225 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114089126","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}
引用次数: 2
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学术官方微信
小红书