基于查找表网表的逆向工程字级模型
Reverse Engineering Word-Level Models from Look-Up Table Netlists
摘要:
从位流到RTL模型的FPGA设计的逆向工程有助于理解设计的高级功能以及验证和重建传统设计。快速进位链通常用于FPGA设计中的运算符综合。我们提出了一种方法来检测字级结构,通过分析这些进位链的LUT(查找表)级网表。我们还提出了方法,以适应现有的技术,以确定组合操作和顺序模块的ASIC网表LUT网表。所有开发和调整的技术被整合到一个集成的工具链中,以帮助从LUT级网表进行字级设计的逆向工程。当对一组真实世界的设计进行评估时,工具链推断网表中34%到100%的元素是已知字级操作或已知顺序模块的一部分。
英文摘要:
Reverse engineering of FPGA designs from bitstreams to RTL models aids in understanding the high level functionality of the design and for validating and reconstructing legacy designs. Fast carry-chains are commonly used in synthesis of operators in FPGA designs. We propose a method to detect word-level structures by analyzing these carry-chains in LUT (Look-Up Table) level netlists. We also present methods to adapt existing techniques to identify combinational operations and sequential modules in ASIC netlists to LUT netlists. All developed and adapted techniques are consolidated into an integrated tool-chain to aid in reverse engineering of word-level designs from LUT-level netlists. When evaluated on a set of real-world designs, the tool-chain infers 34\% to 100\% of the elements in the netlist to be part of a known word-level operation or a known sequential module.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。