一种快速大数乘法器的设计方法——大数乘法的高速实现

One Large Multiplication's Fast Implementation

本文介绍了大数乘法器的一种高速实现算法,采用了Booth算法和Wallace Tree算法,通过减少部分积,并把大数加法拆分为32位的加法来实现对于大数乘法的高速运算.其核心的数据通路仅有一个16位的乘法器和一个32位的加法器组成,真正实现了以"小"资源实现了"大"运算.

This paper uses Booth algorithm and Wallace Tree to deduce the part - product, and a 32 Bit adder which implement a large adder to implement fast large multiplication. The core data path are just a 16 Bit multiplication and a 32 Bit adder, it implement less resource with larger arithmetic.