计算机工程与应用 ›› 2017, Vol. 53 ›› Issue (21): 58-61.DOI: 10.3778/j.issn.1002-8331.1606-0358

• 理论与研发 • 上一篇    下一篇

基于FPGA的进位存储大数乘法器的改进与实现

张晓楠1,高献伟1,2,董秀则2   

  1. 1.西安电子科技大学 通信工程学院,西安 710071
    2.北京电子科技学院 电子系,北京 100070
  • 出版日期:2017-11-01 发布日期:2017-11-15

Improvement and implementation of carry-save large numbers multiplication on FPGA

ZHANG Xiaonan1, GAO Xianwei1,2, DONG Xiuze2   

  1. 1.School of Telecommunication Engineering, Xidian University, Xi’an 710071, China
    2.Department of Electronics, Beijing Electronics Science & Technology Institute, Beijing 100070, China
  • Online:2017-11-01 Published:2017-11-15

摘要: 提出了一种基于FPGA的进位存储的大数乘法器的改进算法,该算法采用串并混合结构可以在一个时钟内完成多次迭代计算,减少了完成一次运算的时钟数,因此有效地提高了大数乘法器的速度。最后硬件结构设计在Altera Stratix II EP2S90F1508C3上实现,给出了192位、256位以及384位的乘法器性能分析,其中,192位可达到0.18?μs,256位达到0.27?μs,384位达到0.59?μs,速度上都提高了3.5倍左右。

关键词: 大数乘法, 串并混合结构, 多次迭代, 现场可编程门阵列

Abstract: This paper proposes an improved algorithm of carry-save large numbers multiplication on FPGA, which can complete multiple iterations of operation in a clock with a serial-parallel hybrid structure. To some extent, reducing clocks to complete a operation, the structure improves the speed of the large numbers multiplication effectively. Finally, the results of the implementation of this multiplier for several operands sizes(192 bit, 256 bit, 384 bit) on Altera Stratix II EP2S90F1508C3 show that the time of 192 bit is 0.185 microsecond , 256 bit is 0.271 microsecond, and 384 bit is 0.595 microsecond. As a result, the paper’s design is about 3.5 times than the previous design in speed.

Key words: large numbers multiplication, serial-parallel hybrid structure, multiple iterations, Field Programmable Gate Array(FPGA)