Polynomial datapath optimization using partitioning and compensation heuristics
Polynomial datapath optimization using partitioning and compensation heuristics
复制标题
使用分区和补偿启发法进行多项式数据路径优化
DOI：
10.1145/1629911.1630151
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
M. Fujita
中科院分区：
文献类型：
--
作者：
O. Sarbishei;B. Alizadeh;M. Fujita
在 Z2 n 上执行多项式计算的数据路径设计用于许多应用，例如计算机图形和数字信号处理领域。随着此类应用市场的不断增长，多元多项式的高级综合和优化技术的改进变得非常具有挑战性。本文提出了一种有效的算法，用于在乘法器和加法器的数量方面优化 Z2 n 上多元多项式的实现。与传统方法相比，该方法利用有前景的启发式方法从多项式中提取更复杂的公共子表达式。所提出的算法还利用规范决策图、霍纳展开图 (HED) [1] 来减少 Z2 n 上的多项式次数。实验结果表明，与现有的高级综合工具以及最先进的代数方法相比，逻辑门数量和关键路径延迟分别平均节省了 27% 和 10%。
Datapath designs that perform polynomial computations over Z2 n are used in many applications such as computer graphics and digital signal processing domains. As the market of such applications continues to grow, improvements in high-level synthesis and optimization techniques for multivariate polynomials have become really challenging. This paper presents an efficient algorithm for optimizing the implementation of a multivariate polynomial over Z2 n in terms of the number of multipliers and adders. This approach makes use of promising heuristics to extract more complex common sub-expressions from the polynomial compared to the conventional methods. The proposed algorithm also utilizes a canonical decision diagram, Horner-expansion diagram (HED) [1] to reduce the polynomial's degree over Z2 n. Experimental results have shown an average saving of 27% and 10% in terms of the number of logic gates and critical path delay respectively compared to existing high-level synthesis tools as well as state of the art algebraic approaches.
搜索与 B/R4RGS 结合的支架蛋白
DOI：
--
发表时间：
2006
期刊：
影响因子：
--
作者：
藤井 聖司;牟田 貴里子;齊藤 修
通讯作者：
齊藤 修