首页 | 官方网站   微博 | 高级检索  
     

大数模乘脉动阵列的FPGA细粒度映射实现
引用本文:黄谆,白国强,陈弘毅.大数模乘脉动阵列的FPGA细粒度映射实现[J].微电子学与计算机,2005,22(7):31-35,41.
作者姓名:黄谆  白国强  陈弘毅
作者单位:清华大学微电子学研究所,北京,100084
摘    要:通过分析FPGA可配置逻辑块的细致结构,提出了一种基于FPGA的细粒度映射方法,并使用该方法高效实现了大数模乘脉动阵列.在保持高速计算特点的同时,将模乘脉动阵列的资源消耗降低为原来的三分之一.在低成本的20万门级FPGA器件中即可实现1024位模乘器.该实现每秒可进行20次RSA签名.如果换用高性能FPGA,签名速度更可提高至每秒40次.

关 键 词:现场可编程门阵列(FPGA)  细粒度映射  Montgomery算法  脉动阵列
文章编号:1000-7180(2005)07-031-05
收稿时间:2004-11-16
修稿时间:2004-11-16

FPGA Implementation of Systolic Array for Modular Multiplication Using a Fine-grained Approach
HUANG Zhun,BAI Guo-Qiang,CHEN hong-yi.FPGA Implementation of Systolic Array for Modular Multiplication Using a Fine-grained Approach[J].Microelectronics & Computer,2005,22(7):31-35,41.
Authors:HUANG Zhun  BAI Guo-Qiang  CHEN hong-yi
Abstract: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.
Keywords:FPGA  Fine-grained mapping  Montgomery algorithm  Systolic array
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号