当前位置: X-MOL 学术Int. J. Circ. Theory Appl. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Resubstitution method for big size Boolean logic design targeting look-up-table implementation
International Journal of Circuit Theory and Applications ( IF 1.8 ) Pub Date : 2021-06-15 , DOI: 10.1002/cta.3086
Igor Lemberski 1 , Artjoms Suponenkovs 1
Affiliation  

A scalable design method to perform multilevel network minimization targeting k-input look-up-tables (k-LUT) is proposed. It contributes toward the big size logic design theory and application. The method is based on the resubstitution which is formulated and solved as a covering task: A node function, which depends on an input selected for the resubstitution, is split into a set of dichotomies. The selected input is removed, and the minimal set of inputs to cover the dichotomies are sought. The resubstitution procedure runs on top of the k-LUT network produced by existing synthesis tools (SIS, ABC). Scalability is achieved by the extraction of windows, which satisfy given constraints (number of inputs, nodes, etc.). The window logic is described using the proposed extended programmable logic array (PLA) table, which contains information about don't cares. Experiments show that the best networks obtained using SIS and ABC can be further improved by applying our method. Also, big benchmarks from the EPFL library are processed, and for almost half of them, improvements are achieved.

中文翻译:

针对查找表实现的大尺寸布尔逻辑设计的再代入方法

提出了一种针对 k 输入查找表 (k-LUT) 执行多级网络最小化的可扩展设计方法。对大尺寸逻辑设计理论和应用做出了贡献。该方法基于作为覆盖任务制定和求解的重新替换:依赖于为重新替换选择的输入的节点函数被分成一组二分法。移除选定的输入,并寻找覆盖二分法的最小输入集。重新替换过程在现有综合工具(SIS、ABC)生成的 k-LUT 网络之上运行。可扩展性是通过提取满足给定约束(输入数量、节点等)的窗口来实现的。使用建议的扩展可编程逻辑阵列 (PLA) 表描述窗口逻辑,其中包含有关不关心的信息。实验表明,通过应用我们的方法,可以进一步改进使用 SIS 和 ABC 获得的最佳网络。此外,还处理了来自 EPFL 库的大型基准测试,其中几乎一半都实现了改进。
更新日期:2021-08-12
down
wechat
bug