乘数:在常规和饱和算法中,用于高达32位输入的基于傅立叶变换的方法和Synopsys设计技术的比较
Multipliers: comparison of Fourier transformation based method and Synopsys design technique for up to 32 bits inputs in regular and saturation arithmetics
摘要:
介绍了基于傅里叶变换的硬件乘法技术。该技术具有最高效率的乘法单元高达8位的范围。每个乘法单元都是基于最小化的布尔函数来实现的。实验数据表明,与Synopsys技术设计的类似方法相比,该技术在输入操作数为2-8位时,乘法运算速度提高了20%;在输入操作数为8-32位时,乘法运算速度提高了3%。
英文摘要:
The technique for hardware multiplication based upon Fourier transformation has been introduced. The technique has the highest efficiency on multiplication units with up to 8 bit range. Each multiplication unit is realized on base of the minimized Boolean functions. Experimental data showed that this technique the multiplication process speed up to 20% higher for 2-8 bit range of input operands and up to 3% higher for 8-32 bit range of input operands than analogues designed by Synopsys technique.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。