arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2405.02047cs.AR
收藏

面向FPGA的基于不完整子乘法器的小型逻辑乘法器

Small Logic-based Multipliers with Incomplete Sub-Multipliers for FPGAs

Andreas Böttcher, Martin Kumm

AI总结:

本文针对FPGA上低精度AI推理需求,提出基于不完整非矩形子乘法器瓦片的小型逻辑乘法器设计方法,并利用整数线性规划求解最优结构,在FPGA综合实验中验证了其优于现有设计。

摘要:

人工智能(AI)推理领域近期呈现向低精度数据格式发展的趋势,位宽已降至8位甚至更低。由于乘法是典型推理任务中最复杂的运算,因此对高效小型乘法器存在巨大需求。大型DSP模块在高效实现大量小型乘法器方面存在局限性。为此,本文提出一种更优的基于逻辑的乘法器方案,尤其适用于小型乘法器。我们的工作基于乘法器拼接(multiplier tiling)方法,即由若干子乘法器瓦片(sub-multiplier tile)构成一个乘法器。我们做出的关键观察是:这些子乘法器不必执行完整的(矩形)N×K乘法,可以采用更高效的不完整(非矩形)子乘法器。本文首先致力于识别高效的不完整不规则子乘法器,然后展示其相对于最先进设计的改进。研究表明,可以利用整数线性规划(ILP)找到最优解,并在FPGA综合实验中进行了评估。

英文摘要:

There is a recent trend in artificial intelligence (AI) inference towards lower precision data formats down to 8 bits and less. As multiplication is the most complex operation in typical inference tasks, there is a large demand for efficient small multipliers. The large DSP blocks have limitations implementing many small multipliers efficiently. Hence, this work proposes a solution for better logic-based multipliers that is especially beneficial for small multipliers. Our work is based on the multiplier tiling method in which a multiplier is designed out of several sub-multiplier tiles. The key observation we made is that these sub-multipliers do not necessarily have to perform a complete (rectangular) NxK multiplication and more efficient sub-multipliers are possible that are incomplete (non-rectangular). This proposal first seeks to identify efficient incomplete irregular sub-multipliers and then demonstrates improvements over state-of-the-art designs. It is shown that optimal solutions can be found using integer linear programming (ILP), which are evaluated in FPGA synthesis experiments.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑