Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


46682.pdf (9.12 MB)

ETD Abstract Container

Abstract Header

Reverse Engineering Data Path Elements From LUT Netlists Using Graph Neural Networks

Pula, Kishore
http://orcid.org/0009-0004-5494-9593
http://rave.ohiolink.edu/etdc/view?acc_num=ucin1692286213401422

Abstract Details

2023, MS, University of Cincinnati, Engineering and Applied Science: Computer Engineering.
One of the most important tasks in the field of electronic design automation (EDA) is the functional reverse engineering (RE) of flattened Field Programmable Gate Array (FPGA) Look-Up Table (LUT) netlists to their Register Transfer Level (RTL) representation. Legacy designs can be difficult to comprehend since they often lack adequate documentation or the original design files. By converting the netlists to RTL representation, engineers can gain a better understanding of the design's functionality and make improvements or modifications easily. Traditional netlist reverse engineering techniques can be time-consuming and error-prone as they manually examine the netlist and determine the underlying RTL structure. However, recent developments in machine learning, notably in the area of graph neural networks (GNNs), have demonstrated significant progress in addressing EDA issues. In this thesis, we presented a tool RELUT-GNN, that extracts high-level functionality from FPGA netlists using GNNs. To achieve this, a graph representation of the netlist structure is created, with the FPGA leaf cells serving as the nodes and the connected nets serving as the edges. GNNs can efficiently capture the connections and interdependence between the various design aspects by considering the netlist as a undirected graph. To train the GNN, a comprehensive custom dataset is constructed, which contains various data path elements commonly found in FPGA designs, such as Operators, Shifters, Counters, and Finite State Machines (FSMs). The dataset also includes combinations of these elements with varying bit widths, allowing the model to learn the diverse patterns and behaviors of different design components. During training, the GNN learns to aggregate the features of each node along with information from its neighboring nodes. This enables the model to capture the structural characteristics of the netlist and extract the high-level functionality of the sub-circuits within it. To evaluate the performance of the proposed approach, the model is tested on real-world designs obtained from Opencores and ITC99, which provide a diverse set of benchmarks. The classification accuracy is used as the evaluation metric. Our model achieved a combined accuracy of 97.12\% which indicates that the model can accurately extract the high-level functionality of FPGA netlists and represented them in their RTL counterparts.
John Emmert, Ph.D. (Committee Member)
Ranganadha Vemuri, Ph.D. (Committee Chair)
Wen-Ben Jone, Ph.D. (Committee Member)
107 p.
Computer Engineering
FPGA; Reverse Engineering; Graph Neural Networks; Hardware Security; Verilog; RELUT-GNN

Recommended Citations

Citations

  • Pula, K. (2023). Reverse Engineering Data Path Elements From LUT Netlists Using Graph Neural Networks [Master's thesis, University of Cincinnati]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1692286213401422

    APA Style (7th edition)

  • Pula, Kishore. Reverse Engineering Data Path Elements From LUT Netlists Using Graph Neural Networks. 2023. University of Cincinnati, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=ucin1692286213401422.

    MLA Style (8th edition)

  • Pula, Kishore. "Reverse Engineering Data Path Elements From LUT Netlists Using Graph Neural Networks." Master's thesis, University of Cincinnati, 2023. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1692286213401422

    Chicago Manual of Style (17th edition)

ucin1692286213401422
115
© 2023, some rights reserved.Creative Commons License Reverse Engineering Data Path Elements From LUT Netlists Using Graph Neural Networks by Kishore Pula is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License. Based on a work at etd.ohiolink.edu.
This open access ETD is published by University of Cincinnati and OhioLINK.