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

筛选
英文 中文
Jacobi-specific processor arrays 特定于jacobi的处理器数组
H. W. V. Dijk, G. Hekstra, E. Deprettere
{"title":"Jacobi-specific processor arrays","authors":"H. W. V. Dijk, G. Hekstra, E. Deprettere","doi":"10.1109/ASAP.1996.542827","DOIUrl":"https://doi.org/10.1109/ASAP.1996.542827","url":null,"abstract":"We present a processor and a compiler for prototyping array implementations of algorithms from the class of Jacobi algorithms. We use adaptive matrix QR decomposition as an illustrative example.","PeriodicalId":397756,"journal":{"name":"Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96","volume":"3 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":"117021841","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
Automatic generation of modular mappings 模块映射的自动生成
Hyuk-Jae Lee, J. Fortes
{"title":"Automatic generation of modular mappings","authors":"Hyuk-Jae Lee, J. Fortes","doi":"10.1109/ASAP.1996.542810","DOIUrl":"https://doi.org/10.1109/ASAP.1996.542810","url":null,"abstract":"Modular mappings have been recently proposed for optimization of algorithms that cannot be efficiently mapped by affine mappings. This paper addresses the problem of generating modular mappings that satisfy conditions for validity and optimality. In general, this is a difficult problem due to the presence of non-linear constraints. Hence, a method of O(n/sup 2/) complexity is provided to assign values to some entries of a transformation matrix so that non-linear constraints are transformed into linear ones, where n is the dimension of a computation domain. The proposed heuristic attempts to reduce the number of value-assigned entries and exclude as few solutions as possible. This paper also considers the issue of deriving the inverse transformation of a given modular mapping. It identifies a class of modular functions whose inverses result directly from computing the inverse of the (coefficient) matrix used to specify a modular mapping. An efficient method of O(n/sup 2/) complexity is provided to formulate the problem of generating such modular mappings as an integer linear programming problem.","PeriodicalId":397756,"journal":{"name":"Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96","volume":"15 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":"123633856","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
Performance modeling and tradeoff analysis during rapid prototyping 快速原型过程中的性能建模和权衡分析
J. Walrath
{"title":"Performance modeling and tradeoff analysis during rapid prototyping","authors":"J. Walrath","doi":"10.1109/ASAP.1996.542826","DOIUrl":"https://doi.org/10.1109/ASAP.1996.542826","url":null,"abstract":"Tradeoff analysis is a central aspect of any design process. Languages and tools to support performance modeling and tradeoff analysis are necessary to facilitate rapid prototyping of designs. An effective modeling and evaluation environment reduces the overall design time of both the prototype and the final product by helping designers in determining which parameters of a design are critical for meeting a set of desired performance goals. This paper describes a case study in performance modeling using a language called PDL (Performance Modeling Language). The PDL system supports tradeoff analysis and performance visualization. This paper also addresses some of the key issues for successful tradeoff analysis during rapid prototyping and explains how many features of PDL make it a suitable choice for this purpose.","PeriodicalId":397756,"journal":{"name":"Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96","volume":"48 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":"131382801","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
Extension of the ALPHA language to recurrences on sparse periodic domains ALPHA语言在稀疏周期域上递归的扩展
P. Quinton, S. Rajopadhye, T. Risset
{"title":"Extension of the ALPHA language to recurrences on sparse periodic domains","authors":"P. Quinton, S. Rajopadhye, T. Risset","doi":"10.1109/ASAP.1996.542832","DOIUrl":"https://doi.org/10.1109/ASAP.1996.542832","url":null,"abstract":"ALPHA is a functional language based on systems of affine recurrence equations over polyhedral domains. We present an extension of ALPHA to deal with sparse polyhedral domains. Such domains are modeled by Z-polyhedra, namely the intersection of lattices and polyhedra. We summarize the mathematical closure properties of Z-polyhedra, and we show how the important features of ALPHA, namely normalization, substitution, change of basis, are preserved in the extension.","PeriodicalId":397756,"journal":{"name":"Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96","volume":"4 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":"133636858","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}
引用次数: 9
A VLSI system architecture for real-time intelligent decision making 一种用于实时智能决策的VLSI系统架构
M. Patel, N. Ranganathan
{"title":"A VLSI system architecture for real-time intelligent decision making","authors":"M. Patel, N. Ranganathan","doi":"10.1109/ASAP.1996.542817","DOIUrl":"https://doi.org/10.1109/ASAP.1996.542817","url":null,"abstract":"In this paper, we describe a VLSI system architecture for real-time intelligent decision making. The architecture integrates the adaptability of a backpropagation based neural network and the decision making ability of a rule based fuzzy expert system on a chip. The intelligent decision making system consists of a back-propagation based neural network for adaptive learning and a rule-based fuzzy expert system for decision making. Both the neural network and the expert system are realized as linear systolic arrays. Thus, the entire system can be implemented in VLSI with a few basic cells. The architecture exploits the principles of pipelining and parallelism to the maximum possible extent in order to achieve high speed and throughput. The proposed hardware can yield a real-time decision every 5ns based on a 200 MHz clock. Currently, a prototype CMOS VLSI chip implementing the proposed architecture is being built and verified.","PeriodicalId":397756,"journal":{"name":"Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96","volume":"5 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":"133144283","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
Reconfigurable processing with field programmable gate arrays 可重构处理与现场可编程门阵列
B. Fawcett, J. Watson
{"title":"Reconfigurable processing with field programmable gate arrays","authors":"B. Fawcett, J. Watson","doi":"10.1109/ASAP.1996.542824","DOIUrl":"https://doi.org/10.1109/ASAP.1996.542824","url":null,"abstract":"In-system-programmable, SRAM-based Field Programmable Gate Arrays (FPGAs) can be used to create processors and coprocessors whose internal architecture as well as interconnections can be reconfigured to match the needs of a given application. Exploiting the inherent speed and parallelism of a hardware solution, FPGA-based coprocessors can execute computationally-intensive tasks while maintaining the flexibility of a programmable solution. The successes of this approach have led to the introduction of the first FPGA devices designed for coprocessing applications; the XC6200 FPGA architecture features an SRAM control store, abundant registers, on-chip memory capability, support for high-speed full or partial reconfiguration, and a flexible, hierarchical routing scheme.","PeriodicalId":397756,"journal":{"name":"Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96","volume":"25 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":"114458162","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
Latency-constrained resynchronization for multiprocessor DSP implementation 多处理器DSP实现的延迟约束重同步
S. Bhattacharyya, S. Sriram, Edward A. Lee
{"title":"Latency-constrained resynchronization for multiprocessor DSP implementation","authors":"S. Bhattacharyya, S. Sriram, Edward A. Lee","doi":"10.1109/ASAP.1996.542830","DOIUrl":"https://doi.org/10.1109/ASAP.1996.542830","url":null,"abstract":"Resynchronization is a post-optimization for static multiprocessor schedules in which extraneous synchronization operations are introduced in such a way that the number of original synchronizations that consequently become redundant significantly exceeds the number of additional synchronizations. Redundant synchronizations are synchronization operations whose corresponding sequencing requirements are enforced completely by other synchronizations in the system. The amount of run-time overhead required for synchronization can be reduced significantly by eliminating redundant synchronizations. However, since additional serialization is imposed by the new synchronizations resynchronization can produce significant increase in latency. This paper addresses the problem of computing an optimal resynchronization (one that results in the lowest average rate at which synchronization operations have to be performed) among all resynchronizations that do not increase the latency beyond a prespecified upper bound L/sub max/. Our study is based on the context of self-timed execution of iterative data flow programs, which is an implementation model that has been applied extensively for digital signal processing systems.","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":"128329700","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}
引用次数: 14
A flexible motion estimation chip for variable size block matching 可变大小块匹配的柔性运动估计芯片
J. Berns, T. Noll
{"title":"A flexible motion estimation chip for variable size block matching","authors":"J. Berns, T. Noll","doi":"10.1109/ASAP.1996.542806","DOIUrl":"https://doi.org/10.1109/ASAP.1996.542806","url":null,"abstract":"A flexible block matching motion estimation architecture is described. The block size can be adaptively refined with blocks of 8/spl times/8, 16/spl times/16 and 32/spl times/32 pixels or can be set to one of these sizes without significant loss in efficiency in comparison with standard block matching. The chip performs block matching on a search area of /spl plusmn/15 vertically and horizontally for a block size of up to 32/spl times/32. For larger search areas devices can be cascaded. Full search can be processed as well as fast algorithms with an additional external RAM and a RISC processor. Sub-pel precision motion vectors can be derived using a smaller search area or cascading devices. The chip will have a computational power of more than 200 GOPS and a die size of 170 mm/sup 2/ in a 0.5-/spl mu/m CMOS technology.","PeriodicalId":397756,"journal":{"name":"Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96","volume":"15 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":"120934667","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}
引用次数: 13
Microphone array for hearing aid and speech enhancement applications 用于助听器和语音增强应用的麦克风阵列
Arthur Wang, K. Yao, R. E. Hudson, D. Korompis, F. Lorenzelli, S. Soli, S. Gao
{"title":"Microphone array for hearing aid and speech enhancement applications","authors":"Arthur Wang, K. Yao, R. E. Hudson, D. Korompis, F. Lorenzelli, S. Soli, S. Gao","doi":"10.1109/ASAP.1996.542818","DOIUrl":"https://doi.org/10.1109/ASAP.1996.542818","url":null,"abstract":"Microphone array technology has been proposed for various audio, teleconference, hearing aid and voice recognition applications. By forming a focused beam toward the desired speech source, attenuating background noises and rejecting discrete spatial interferers, a microphone array can enhance the signal-to-noise-ratio (SNR) in a noisy environment with notable improvement in speech intelligibility. At the threshold of intelligibility, a one dB improvement in SNR can increase 10-15% speech intelligibility. It is also known that increasing SNR can result in significant improvement in the recognition rate of various automatic voice recognition systems. We propose a novel electronically steerable microphone array based on the maximum energy (ME) concentration criterion, which results in high SNR in rooms with reverberations and competing interferences. We present a prototype PC-based microphone array system designed for hearing aid applications but also applicable to other tasks.","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":"127661310","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}
引用次数: 12
Hierarchical static analysis of structured systems of affine recurrence equations 仿射递推方程结构系统的分层静态分析
F. D. Dinechin, S. Robert
{"title":"Hierarchical static analysis of structured systems of affine recurrence equations","authors":"F. D. Dinechin, S. Robert","doi":"10.1109/ASAP.1996.544733","DOIUrl":"https://doi.org/10.1109/ASAP.1996.544733","url":null,"abstract":"The ALPHA language, based on systems of affine recurrence equations over polyhedral domains, allows the expression of complex algorithms as hierarchical, parameterized structures of such systems. This paper discusses the static analysis of ALPHA programs, an extended type-checking process based on the single assignment rule. We present techniques ensuring, on one hand, that a system is valid (with respect to this rule) within a certain range of its parameters, and on the other, that no system is used with invalid values of its parameters. These techniques have been implemented in a versatile tool for ALPHA which is demonstrated on the example of the Gaussian elimination.","PeriodicalId":397756,"journal":{"name":"Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96","volume":"73 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":"134467565","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
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学术官方微信
小红书