Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003最新文献

筛选
英文 中文
Unified radix-4 multiplier for GF(p) and GF(2^n) GF(p)和GF(2^n)的统一基数-4乘子
Lai-Sze Au, N. Burgess
{"title":"Unified radix-4 multiplier for GF(p) and GF(2^n)","authors":"Lai-Sze Au, N. Burgess","doi":"10.1109/ASAP.2003.1212846","DOIUrl":"https://doi.org/10.1109/ASAP.2003.1212846","url":null,"abstract":"We describe a scalable unified architecture for Montgomery multiplication over either of the finite fields GF(p) and GF(2n). This architecture has the advantage of possessing a new redundant binary adder that supports carry-save additions under either of the Galois fields without the need for an external control signal to specify which field is to be used. Its main advantage over previously reported dual field multiplier is that a control signal which is broadcast to all cells to suppress carries under GF(2n is not needed. Consequently, larger multipliers can be synthesised whose pipelined speed is independent of the buffering required for the control signal.","PeriodicalId":261592,"journal":{"name":"Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127248426","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}
引用次数: 11
Modular multiplication for FPGA implementation of the IDEA block cipher 模块化乘法用FPGA实现的IDEA分组密码
Jean-Luc Beuchat
{"title":"Modular multiplication for FPGA implementation of the IDEA block cipher","authors":"Jean-Luc Beuchat","doi":"10.1109/ASAP.2003.1212864","DOIUrl":"https://doi.org/10.1109/ASAP.2003.1212864","url":null,"abstract":"The IDEA block cipher is a symmetric-key algorithm which encrypts 64 bit plaintext blocks to 64 bit ciphertext blocks, using a 128 bit secret key. The security of IDEA relies on combining operations from three groups: integer addition modulo 2/sup 16/, bitwise exclusive or of two 16 bit words, and modified integer multiplication modulo (2/sup 16/ + 1) which is the critical arithmetic operation of the block cipher. This is devoted to the study of efficient implementations of this operator on Virtex-II and Virtex-E devices. We investigate three algorithms based on a multiplication with a subsequent modulo correction which are particularly well suited for FPGA devices embedding small multiplier blocks. An IDEA processor based on such operators achieves a throughput of 8.5 Gb/s on a Xilinx XC2V1000-6 device. We also describe a new FPGA implementation of a modulo (2/sup n/ + 1) multiplier proposed by R. Zimmermann. The area of this operator is roughly twice smaller than that of previous FPGA implementations.","PeriodicalId":261592,"journal":{"name":"Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123600019","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}
引用次数: 23
Multi-dimensional incremental loop fusion for data locality 数据局部性的多维增量环路融合
Sven Verdoolaege, M. Bruynooghe, Gerda Janssens, F. Catthoor
{"title":"Multi-dimensional incremental loop fusion for data locality","authors":"Sven Verdoolaege, M. Bruynooghe, Gerda Janssens, F. Catthoor","doi":"10.1109/ASAP.2003.1212826","DOIUrl":"https://doi.org/10.1109/ASAP.2003.1212826","url":null,"abstract":"Affine loop transformations have often been used for program optimization. Usually their focus lies on single loop nests. A few recent approaches also handle global programs with multiple loop nests but they are not really scalable towards realistic applications with dozens of nests. To reduce complexity, we split affine transformations into a linear transformation step and a translation step. This translation step can be used to perform general multidimensional loop fusion. We show that loop fusion can be performed incrementally and provide a greedy algorithm, which we illustrate on a simple example. Finally, we present a heuristic for data locality and provide some experimental results.","PeriodicalId":261592,"journal":{"name":"Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128619052","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}
引用次数: 69
Reconfigurable Viterbi decoding using a new ACS pipelining technique 使用新的ACS流水线技术的可重构维特比解码
Yiqun Zhu, M. Benaissa
{"title":"Reconfigurable Viterbi decoding using a new ACS pipelining technique","authors":"Yiqun Zhu, M. Benaissa","doi":"10.1109/ASAP.2003.1212859","DOIUrl":"https://doi.org/10.1109/ASAP.2003.1212859","url":null,"abstract":"A novel reconfigurable Viterbi decoder is proposed, based on an area-efficient ACS architecture, in which the constraint length and traceback depth can be on-line reconfigurable to trade-off decoding capability and decoding speed. Key techniques of the decoder are 5-level ACS (add-compare-select) pipelining and in-place path metric updating, which result in very high decoding speed and low memory usage. To verify the performance of the decoder, an example design with constraint length 7 to 10, has been successfully implemented on Xilinx Virtex FPGA devices. FPGA implementation results, in terms of decoding speed, resource usages and BER, have been obtained. These confirmed the functionality and the expected higher speeds and lower resources.","PeriodicalId":261592,"journal":{"name":"Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129256056","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
Concurrent fault detection in a hardware implementation of the RC5 encryption algorithm 并发故障检测在硬件上实现了RC5加密算法
G. Bertoni, L. Breveglieri, I. Koren, P. Maistri, V. Piuri
{"title":"Concurrent fault detection in a hardware implementation of the RC5 encryption algorithm","authors":"G. Bertoni, L. Breveglieri, I. Koren, P. Maistri, V. Piuri","doi":"10.1109/ASAP.2003.1212865","DOIUrl":"https://doi.org/10.1109/ASAP.2003.1212865","url":null,"abstract":"Recent research has shown that fault diagnosis and possibly fault tolerance are important features when implementing cryptographic algorithms by means of hardware devices. In fact, some security attack procedures are based on the injection of faults. At the same time, hardware implementations of cryptographic algorithms, i.e. crypto-processors, are becoming widespread. There is however, only very limited research on implementing fault diagnosis and tolerance in crypto-algorithms. Fault diagnosis is studied for the RC5 crypto-algorithm, a recently proposed block-cipher algorithm that is suited for both software and hardware implementations. RC5 is based on a mix of arithmetic and logic operations, and is therefore a challenge for fault diagnosis. We study fault propagation in RC5, and propose and evaluate the cost/performance tradeoffs of several error detecting codes for RC5. Costs are estimated in terms of hardware overhead, and performances in terms of fault coverage. Our most important conclusion is that, despite its nonuniform nature, RC5 can be efficiently protected by using low-cost error detecting codes.","PeriodicalId":261592,"journal":{"name":"Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116514481","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}
引用次数: 11
An efficient disk-array-based server design for a multicast video streaming system 一种高效的基于磁盘阵列的多播视频流服务器设计
P. Chan, Jack Y. B. Lee
{"title":"An efficient disk-array-based server design for a multicast video streaming system","authors":"P. Chan, Jack Y. B. Lee","doi":"10.1109/ASAP.2003.1212851","DOIUrl":"https://doi.org/10.1109/ASAP.2003.1212851","url":null,"abstract":"Recently, a number of researchers have started to investigate new video-on-demand (VoD) architectures using batching, patching and periodic broadcasting. These architectures, compared to traditional unicast VoD systems, are much more scalable and can serve thousands or even millions of clients concurrently. Nevertheless, existing studies are usually focused on architectural issues. The problem of designing an efficient server to implement these new multicast VoD architectures has received little attention. While existing server designs using round-based schedulers can still be used, results show that such designs are suboptimal as they do not exploit the characteristics of fixed-schedule periodic broadcasting channels. We address this challenge by presenting an efficient server design for a recent multicast VoD architecture called Super-Scalar Video-on-Demand (SS-VoD). Results show that the efficient server design can increase the system capacity by 60% compared to traditional video server designs. We present details of this new server design, derives a performance model, and analyzes it using numerical results.","PeriodicalId":261592,"journal":{"name":"Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117207249","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
Nanotechnology in the development of future computing systems 纳米技术在未来计算机系统发展中的作用
Toshishige Yamada, M. Meyyappan
{"title":"Nanotechnology in the development of future computing systems","authors":"Toshishige Yamada, M. Meyyappan","doi":"10.1109/ASAP.2003.1212835","DOIUrl":"https://doi.org/10.1109/ASAP.2003.1212835","url":null,"abstract":"Nanoelectronics based on carbon nanotubes and organic molecules as the conducting material has been receiving increasing attention as an alternative to silicon CMOS based computing technology. These new device technologies require development of novel circuits and architectures to be technically feasible and economically viable. We provide an overview of this subject along with opportunities and challenges.","PeriodicalId":261592,"journal":{"name":"Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128248072","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
Variable-length instruction compression for area minimization 面积最小化的变长指令压缩
Piia Simonen, I. Saastamoinen, J. Nurmi
{"title":"Variable-length instruction compression for area minimization","authors":"Piia Simonen, I. Saastamoinen, J. Nurmi","doi":"10.1109/ASAP.2003.1212839","DOIUrl":"https://doi.org/10.1109/ASAP.2003.1212839","url":null,"abstract":"Memories comprise a significant part of chips in embedded applications, thus also contributing considerably to the costs. We present a variable-length compression scheme for reducing program memory footprint in a 32-bit DSP processor. The compression method is based on a static program code analysis. Short operand fields do not provide sufficient repetition individually, so the compression is realized by handling all operands of an instruction as one field. The more a certain operand combination is used, the shorter it is coded. The original combination is placed on a look-up table and the coded bit pattern forms an index to that table. The compression results that are achieved in two test applications are 46% (audio decoder) and 51% (video decoder).","PeriodicalId":261592,"journal":{"name":"Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115967684","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
Circuit characteristics of molecular electronic components 分子电子元件的电路特性
D. Janes, Subhasis Ghosh, Jaewon Choi, S. Lodha
{"title":"Circuit characteristics of molecular electronic components","authors":"D. Janes, Subhasis Ghosh, Jaewon Choi, S. Lodha","doi":"10.1109/ASAP.2003.1212836","DOIUrl":"https://doi.org/10.1109/ASAP.2003.1212836","url":null,"abstract":"Electronic devices based on single molecules, or small assemblies of molecules, are attracting much attention as intrinsically nanoscale devices that can add functionality such as optical emission and nonvolatile storage to silicon-based electronics. One of the key issues in these devices is the nature of the microscopic contacts to the active molecules and the need to develop well-controlled interfaces in order to achieve low-resistance contacts. We describe the formation of suitable contact structures in the form of nanometer scale \"break junctions\" in gold lines, formed by lithographic or electrical means. The structure provides a lead frame for realizing high-quality contacts to nanometer-size molecules and nanoparticles with selective docking achieved by end-groups such as thiol (-SH). Metal-molecule-metal junctions can be formed by chemisorbing short molecules such as 1,4-benzenedithiol on the two electrodes. Current-voltage (I-V) characteristics have been measured for configurations including small numbers of molecules directly bonded in the junction and molecule/nanocluster/molecule assemblies. These junctions are being used as test beds to study electrical conduction through different types of engineered-molecules, and to subsequently develop circuit level models. By integrating these molecules with electrical contacts, selective microscopic events (e.g. doping events or gas docking) can be coupled to external circuitry.","PeriodicalId":261592,"journal":{"name":"Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125611421","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
Systematic register bypass customization for application-specific processors 针对特定应用程序处理器的系统寄存器旁路定制
Kevin Fan, Nathan Clark, Michael L. Chu, K. V. Manjunath, Rajiv A. Ravindran, M. Smelyanskiy, S. Mahlke
{"title":"Systematic register bypass customization for application-specific processors","authors":"Kevin Fan, Nathan Clark, Michael L. Chu, K. V. Manjunath, Rajiv A. Ravindran, M. Smelyanskiy, S. Mahlke","doi":"10.1109/ASAP.2003.1212830","DOIUrl":"https://doi.org/10.1109/ASAP.2003.1212830","url":null,"abstract":"Register bypass provides additional datapaths to eliminate data hazards in processor pipelines. The difficulty with register bypass is that the cost of the bypass network is substantial and grows substantially as processor width or pipeline depth are increased. For a single application, many of the bypass paths have extremely low utilization. Thus, there is an important opportunity in the design of application-specific processors to remove a large fraction of the bypass cost while maintaining performance comparable to a processor with full bypass. We propose a systematic design customization process along with a bypass-cognizant compiler scheduler. For the former, we employ iterative design space exploration wherein successive processor designs are selected based on bypass utilization statistics combined with the availability of redundant bypass paths. Compiler scheduling for sparse bypass processors is accomplished by prioritizing function unit choices for each operation prior to scheduling using global information. Results show that for a 5-issue customized VLIW processor, 70% of the bypass cost is eliminated while sacrificing only 10% performance.","PeriodicalId":261592,"journal":{"name":"Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122134228","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}
引用次数: 30
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学术官方微信