CORC  > 清华大学
大数模乘脉动阵列的FPGA细粒度映射实现
黄谆 ; 白国强 ; 陈弘毅 ; HUANG Zhun ; BAI Guo-qiang ; CHEN Hong-yi
2010-06-09 ; 2010-06-09
关键词现场可编程门阵列(FPGA) 细粒度映射 Montgomery算法 脉动阵列 FPGA, Fine-grained mapping, Montgomery algorithm, Systolic array TN792
其他题名FPGA Implementation of Systolic Array for Modular Multiplication Using a Fine-grained Approach
中文摘要通过分析FPGA可配置逻辑块的细致结构,提出了一种基于FPGA的细粒度映射方法,并使用该方法高效实现了大数模乘脉动阵列。在保持高速计算特点的同时,将模乘脉动阵列的资源消耗降低为原来的三分之一。在低成本的20万门级FPGA器件中即可实现1024位模乘器。该实现每秒可进行20次RSA签名。如果换用高性能FPGA,签名速度更可提高至每秒40次。; A fine-grained mapping approach is proposed according to the analysis of the detailed configurable logic block structure of FPGA device, and it is applied to the design of a systolic array for modular multiplication based on FPGA. Without performance losses, the logic resources consumed by the systolic array are reduced to one-third of its original requirement. By exploiting this approach, it's possible to implement a 1024-bit modular multiplier on a 200K gate low-cost FPGA, which can perform 20 1024-bit RSA signature operations per second. Implemented on a high-end FPGA, the modular multiplier can obtain a performance up to 40 signature operations per second.; 国家自然科学基金(60273004、60236020)资助
语种中文 ; 中文
内容类型期刊论文
源URL[http://hdl.handle.net/123456789/56892]  
专题清华大学
推荐引用方式
GB/T 7714
黄谆,白国强,陈弘毅,等. 大数模乘脉动阵列的FPGA细粒度映射实现[J],2010, 2010.
APA 黄谆,白国强,陈弘毅,HUANG Zhun,BAI Guo-qiang,&CHEN Hong-yi.(2010).大数模乘脉动阵列的FPGA细粒度映射实现..
MLA 黄谆,et al."大数模乘脉动阵列的FPGA细粒度映射实现".(2010).
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace