arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2312.06004cs.AR
收藏

通过 E-Graph 重写实现乘法器优化

Multiplier Optimization via E-Graph Rewriting

Andy Wanna, Samuel Coward, Theo Drane, George A. Constantinides, Miloš D. Ercegovac

AI总结:

针对乘法器设计中预处理与阵列归约的权衡问题,提出基于 e-graph 重写的 OptiMult 框架,以生成定制优化电路,并显著降低平方器和标准乘法器延迟。

摘要:

乘法器电路在以数据通路为主的电路设计中占用大量资源,而 RTL 设计人员仍在为其特定应用构建定制的手工乘法阵列。构建优化的乘法器需要在用于生成更小阵列的预处理与阵列归约之间进行权衡。一种被称为 e-graph 的数据结构最近已被应用于数据通路优化;在该领域中,e-graph 高效探索各种权衡的能力已被证明至关重要。我们提出一种基于 e-graph 的重写框架,用于构建优化的乘法器电路。该框架能够表达替代的乘法器表示,并生成定制化电路设计。我们证明,与逻辑综合所实例化的组件相比,所提出的名为 OptiMult 的工具可将平方器的延迟最高降低 46%,并将标准乘法器的延迟最高降低 9%。

英文摘要:

Multiplier circuits account for significant resource usage in datapath-dominated circuit designs, and RTL designers continue to build bespoke hand-crafted multiplication arrays for their particular application. The construction of an optimized multiplier presents trade-offs between pre-processing to generate a smaller array and array reduction. A data structure known as an e-graph has recently been applied to datapath optimization, where the e-graph's ability to efficiently explore trade-offs has been shown to be crucial. We propose an e-graph based rewriting framework to construct optimized multiplier circuits. Such a framework can express alternative multiplier representations and generate customized circuit designs. We demonstrate that the proposed tool, which we call OptiMult, can reduce the latency of a squarer by up to 46% and reduce the latency of a standard multiplier by up to 9% when compared against logic synthesis instantiated components.

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

↑