Circuit as Set of Points

As the size of circuit designs continues to grow rapidly, artificial intelligence technologies are being extensively used in Electronic Design Automation (EDA) to assist with circuit design. Placement and routing are the most time-consuming parts of the physical design process, and how to quickly evaluate the placement has become a hot research topic. Prior works either transformed circuit designs into images using hand-crafted methods and then used Convolutional Neural Networks (CNN) to extract features, which are limited by the quality of the hand-crafted methods and could not achieve end-to-end training, or treated the circuit design as a graph structure and used Graph Neural Networks (GNN) to extract features, which require time-consuming preprocessing. In our work, we propose a novel perspective for circuit design by treating circuit components as point clouds and using Transformer-based point cloud perception methods to extract features from the circuit. This approach enables direct feature extraction from raw data without any preprocessing, allows for end-to-end training, and results in high performance. Experimental results show that our method achieves state-of-the-art performance in congestion prediction tasks on both the CircuitNet and ISPD2015 datasets, as well as in design rule check (DRC) violation prediction tasks on the CircuitNet dataset. Our method establishes a bridge between the relatively mature point cloud perception methods and the fast-developing EDA algorithms, enabling us to leverage more collective intelligence to solve this task. To facilitate the research of open EDA design, source codes and pre-trained models are released at https://github.com/hustvl/circuitformer.

Paper

References (46)

Scroll for more · 34 remaining

Similar papers

Peer review

Reviewer SgH57/10 · confidence 3/52023-06-18

Summary

This paper introduces a novel perspective on circuit design by treating circuit components as point clouds and utilizing point cloud perception methods for feature extraction. Previous approaches either relied on hand-crafted methods to transform circuit designs into images for CNN feature extraction or employed GNNs for graph-based feature extraction, which required time-consuming preprocessing. In contrast, the proposed method enables direct feature extraction from raw data without preprocessing, allowing for end-to-end training and achieving high performance. Experimental results on the CircuitNet dataset demonstrate the superiority of the proposed method in congestion prediction and design rule check (DRC) violation prediction tasks. This approach establishes a connection between point cloud perception methods and EDA algorithms, facilitating the application of collective intelligence in solving circuit design tasks. The method outperforms hand-crafted features and CNN-based methods in feature extraction while eliminating the need for preprocessing, thereby reducing processing time. The work shows potential as a universal feature extractor for chip design, adaptable to a wide range of downstream tasks.

Strengths

The paper introduces a groundbreaking method that addresses circuit congestion prediction and design rule check (DRC) violation prediction in electronic design automation (EDA). By leveraging the concept of point clouds and incorporating a genetic algorithm (GA) module, the proposed approach achieves significant improvements over existing techniques commonly employed in EDA tools. The utilization of point cloud perception enables a fresh perspective on circuit design analysis, allowing for more accurate and efficient prediction of congestion and violations. Additionally, the integration of the GA module enhances the optimization process, leading to enhanced results and performance. This novel method showcases the potential for innovative approaches in EDA, opening doors to advanced techniques that can better handle circuit design challenges and contribute to improved circuit performance and reliability.

Weaknesses

To enhance the comprehensiveness of the paper, it would be valuable to expand the evaluation to encompass other applications within the domain of electronic design automation (EDA), such as circuit placement. By investigating the effectiveness of the proposed method in various EDA tasks, including placement, the authors can provide a more holistic understanding of its capabilities and potential impact. Furthermore, conducting additional ablation studies that delve into the runtime and scaling model trade-offs would contribute to a deeper analysis of the proposed approach. These studies would shed light on the performance and efficiency aspects of the method, allowing for a better understanding of its behavior under different conditions and dataset sizes. This information would be particularly useful for practitioners and researchers aiming to apply the method in real-world scenarios. Another aspect worth exploring is the authors' emphasis on the encoder while leaving the decoder section with limited analysis. This raises intriguing questions regarding the possibility of modifying the output format to potentially improve the EDA software pipeline. Investigating alternative output formats or exploring ways to optimize the decoder component could uncover opportunities for further enhancing the proposed method's integration into EDA workflows. Moreover, the paper opens up avenues for considering the incorporation of this approach into other areas of EDA tools beyond congestion prediction and DRC violation prediction. Exploring how the proposed method could be leveraged in other stages of the EDA process, such as routing, power optimization, or physical design verification, would demonstrate its versatility and potential for broader application. This could foster innovation in multiple facets of EDA, leading to more efficient and advanced chip designs. By addressing these suggestions, the paper would offer a more comprehensive evaluation, deeper insights into runtime and scaling trade-offs, considerations for optimizing the decoder section, and opportunities for applying the proposed approach in various EDA tool domains. These extensions would further solidify the paper's contribution and provide valuable guidance for future research and development in the EDA field.

Questions

A few questions: In figure 5 shows, 3x model size than unet. Which creates the question of scaling model. If a smaller version of the model with same size of Unet will get better accuracy? In figure 4 shows preprocessing times, what is the total runtime and inference time of the model?

Rating

7: Accept: Technically solid paper, with high impact on at least one sub-area, or moderate-to-high impact on more than one areas, with good-to-excellent evaluation, resources, reproducibility, and no unaddressed ethical considerations.

Confidence

3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

3 good

Presentation

2 fair

Contribution

3 good

Limitations

The authors addressed the limitations correctly.

Reviewer DbXo6/10 · confidence 2/52023-07-04

Summary

This paper proposes to use point cloud perception methods to extract features from the circuit by treating the circuit components as point clouds. The proposed method solves the infeasibility of end-to-end training in the CNN-based method and the limitation of time-consuming preprocessing in the GNN-based method. The evaluation result shows the effectiveness of the proposed method on CircuitNet dataset: it outperforms the mainstream CNN-based and GNN-based methods on congestion prediction and design rule check violation prediction.

Strengths

1. This paper facilitates Electronic Design Automation (EDA) by using the well-researched point cloud perception methods, providing a new perspective for circuit design. 2. The encoder part, especially the multi-scale grid-based attention architecture, reduces the computational complexity, and compresses the information as well.

Weaknesses

1. Please give the runtime latency comparison with the CNN-based method to prove the proposed method reduces design cycles.

Questions

1. In the decoder part, motivations for using ResNet18 and UNet++ are missing. Is the selection of network architecture in the decoder part based on the downstream tasks? For different tasks, is necessary to use different networks?

Rating

6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.

Confidence

2: You are willing to defend your assessment, but it is quite likely that you did not understand the central parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

3 good

Presentation

3 good

Contribution

2 fair

Limitations

The authors addressed limitations.

Reviewer rfmi6/10 · confidence 4/52023-07-06

Summary

This paper proposes a new perspective on circuit design by viewing circuit components as point clouds and using point cloud perception methods to extract features from circuits. This achieves the goals of directly extracting features from raw data, end-to-end training, and high performance. Experimental results show that the method achieves state-of-the-art performance on congestion prediction and design rule checking tasks.

Strengths

a. Overall summary: The authors propose a novel approach for chip design and manufacturing processes using Electronic Design Automation (EDA) algorithms and tools. b. Methods: The authors treat circuit components as point clouds and use point cloud perception methods for feature extraction. They utilize a grid-based attention (GA) module to aggregate multi-scale and global geometric information. The encoder converts point-wise features to grid-wise features and generates grid-wise features using a scatter-sum operator. The decoder refines and downsamples the features extracted by the encoder using a ResNet-18 backbone and a UNet++ segmentation head. The loss function incorporates label distribution smoothing to address imbalanced classification problems. c. Experimental results: The authors conducted experiments on the CircuitNet dataset. The proposed method achieved state-of-the-art performance in congestion prediction and design rule check (DRC) violation prediction tasks. The method outperformed UNet in terms of performance, with a runtime memory of 3721MB for the proposed method and 1931MB for UNet.

Weaknesses

N/A

Questions

N/A

Rating

6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.

Confidence

4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.

Soundness

3 good

Presentation

3 good

Contribution

3 good

Limitations

The limitations is not explicitly discussed, but the future work has plotted the current limitation and proposed the next direction that authors will try to tackle such limitation. No negative societal impact

Reviewer YScf4/10 · confidence 4/52023-07-07

Summary

The manuscript presents several claims. Firstly, it introduces a novel perspective on "point cloud perception methods" for performing EDA tasks. By treating circuit components as point clouds and utilizing point cloud perception networks, the paper proposes an innovative approach to solving these tasks. Secondly, it claims superiority over CNN and GNN-based methods commonly used for EDA tasks. The authors assert that their method outperforms these existing techniques. Thirdly, the paper positions itself as the state-of-the-art solution for EDA tasks. The experimental section is well-written, easy to understand, and the overall presentation flow of the manuscript is good.

Strengths

In terms of originality, paper uses novel perspective on the solving the EDA problems which novelty in the paper. clear description of the method, and well-structured experimental section, which includes an ablation study to enhance the validity

Weaknesses

The experimental results provided in the paper are not sufficient. For instance, Table1 shows the comparison of congestion with CNN and GNN methods. However, in case of CNN the cited paper uses ISPD2015 dataset (Open source in circuitnet), while this paper uses circuitnet. It may be better first show comparison with Circuitnet paper https://www.sciengine.com/SCIS/doi/10.1007/s11432-022-3571-8 Similarly, CircuitGNN[39] which uses the ISPD2011 dataset while this paper uses Circuitnet dataset. Maybe add another comparison point cloud perception methods vs CircuitGNN on ISPD 2011 dataset.

Questions

1. Add more comparison SOTA GNN & CNN based method comparisons for both congestion and DRC violation prediction 2. Show results on other open-source datasets like (ISPD2015 which is available in circuitnet with grid level labels) and DAC 2012. 3. The paper mentions “performance is higher without excessive GPU memory” but the memory required here is approximately double that Unet. If authors could show the comparison of memories size of graph and memory required by your method and SOTA methods would be fair. 4. The paper mentions that “novel perspective on circuit design” and “work has the potential to serve as a universal feature extractor for chip design” But only showed two tasks. To make these claim needs to perform other tasks in circuit design like power prediction, and delay prediction.

Rating

4: Borderline reject: Technically solid paper where reasons to reject, e.g., limited evaluation, outweigh reasons to accept, e.g., good evaluation. Please use sparingly.

Confidence

4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.

Soundness

3 good

Presentation

3 good

Contribution

2 fair

Limitations

• The scope of idea is may be limited by the size of the graph. For example, if the graph contains millions of nodes and edges which requires large GPU memory to process. • Generalization of the method presented in paper is explored it might be the limitation since it only works on grid-based dataset. But GNN is more generalized to solve EDA problems since netlist is a graph.

Reviewer SgH52023-08-16

thanks for clarification

thanks for clarification and for acknowledging the points.

Reviewer YScf2023-08-18

Thank you for your responses. I still have some concerns. 1. > work has the potential to serve as a universal feature extractor for chip design Table G3, all results are worse than MAVIRE in terms of pearson, spearman, kenall. Please justify the claim of "universal feature extractor". 2. The CircuitGNN results in Table G1 seems to be worse than its original paper on ISPD 2015 dataset. Table G1 also missed other important references (e.g., HybribNet [a]). In Table G1, the pearson, spearman, Kendall for CircuitGNN are 0.394, 0.1912, 0.1614 while in work [a], the pearson, spearman, Kendall for CirctuiGNN (they used "NetlistGNN" to refer the same paper) are 0.413, 0.216, 0.189 (all are higher than yours). In addition, work [b] has a better performance (0.271 on Spearman, 0.220 on Kendall) than yours (0.2244 on Spearman, 0.1710 on Kendall). [a] HybridNet: Dual-Branch Fusion of Geometrical and Topological Views for VLSI Congestion Prediction, https://arxiv.org/abs/2305.05374 3. >Table G5: The performance of models with different numbers of stages on the CircuitNet congestion prediction task, and their runtime memory during the processing of superbule12, which consists of 1,287,038 nodes. It is not correct. Superblue12 is NOT in the CircuitNet congestion prediction task. superblue12 is from ISPD 2015. 4. The scalability of this paper is much lower compared to SOTA. The nearly doubled memory ("As a quantitative reference, the runtime memory of ours is 3721MB, while that of UNet is 1931MB") overhead brought from this paper will not be able to handle large graphs. Calling "without consuming excessive GPU memory" is not appropriate. 5. In addition, there are many large graphs in the EDA process, such as high-bit CSA multipliers, e.g., in GAMORA [b], that requires multi GPUs to process. In those graphs, the proposed methods in this paper would not work. [b] Gamora: Graph Learning based Symbolic Reasoning for Large-Scale Boolean Networks, DAC, 2023 6. Figure 2 lacks details. It is the visulazation of what dataset?

Authorsrebuttal2023-08-19

Thanks and Response to Reviewer YScf (1/2)

Thank you for your feedback. We are glad to have addressed some of your concerns. Regarding your further questions, we would like to provide some clarifications. **Response to Question 1:** As mentioned in **Response 4** in our first reply, MAVIREC uses five power maps as its input, including internal power map, switching power map, toggle rate scaled power map, all power map and time-decomposed power map. These power maps are generated with a power report from Innovus(an EDA tool). These features contain a much higher level of information than the raw position data. However, since the CircuitNet dataset does not provide a node-wise power report, our model only uses the original position as input. Even so, our model's performance is very close to that of MAVIREC. This also demonstrates that our method serves as a universal feature extractor, we do not rely on high-level power reports, which are not easily obtainable at a low cost. This flexibility also showcases the universality of our model. We have reasons to believe that if we can have node-wise power as input, our model can achieve better performance than MAVIREC. **Response to Question 2:** Due to the complexity of the issues raised, we will address your questions sentence by sentence for clarity and accuracy. > The CircuitGNN results in Table G1 seems to be worse than its original paper on ISPD 2015 dataset. The dataset used in the original CircuitGNN paper was ISPD2011, not ISPD2015, which we used in our study. > Table G1 also missed other important references (e.g., HybribNet [a]). HybribNet has a better performance Firstly, HybribNet first submitted on arxiv on May.7th 2023, just ten days before the NeurIPS 2023 deadline (May.17th 2023), according to NeurIPS 2023 call for papers(https://neurips.cc/Conferences/2023/CallForPapers), it is our contemporaneous work, we should not be asked to compare our work with it. Furthermore, we can also provide an explanation for the results of HybribNet. In HybribNet, they set the number of training epochs to 500, while in our paper, all models were trained for only 100 epochs (for more details, please refer to Section 4.2 of our paper). Therefore, directly comparing our model to theirs would be unfair. > the pearson, spearman, Kendall for CirctuiGNN in HybribNet [a] are higher than CirctuiGNN in your rebuttal Similar to the previous point, in HybribNet, the CircuitGNN was trained for 500 epochs. However, for a fair comparison, all models in our paper, including CircuitGNN, were trained for only 100 epochs, which aligns with the settings specified in the original CircuitGNN paper. **Response to Question 3:** We would like to provide an explanation for the results in Table G5. We are aware that superblue12 is a design from the ISPD2015 dataset. We chose to use it for the runtime memory test because it is the largest design among all the designs in the ISPD2015 dataset and the CircuitNet dataset. By selecting it as an extreme case, we aim to demonstrate that our model can handle such challenging designs, let alone smaller-scale designs. **Response to Question 4:** We must acknowledge that in large-scale circuit design,the runtime memory of our model is bigger than that of CNN-based models (e.g., UNet). This is because CNN-based models convert circuit designs into fixed-sized images regardless of the circuit's scale, resulting in a significant loss of fine-grained features. Additionally, they can only handle grid-level tasks. In addition, for GNN-based methods, the results presented in Table G5 in global rebuttal show that our model of both 1-stage and 2-stage versions exhibits lower runtime memory usage compared to the GNN-based SOTA(CircuitGNN) , while also delivering better performance. We believe that this evidence demonstrates that our model exhibits higher scalability compared to GNN-based SOTA

Authorsrebuttal2023-08-19

Thanks and Response to Reviewer YScf (2/2)

**Response to Question 5:** GAMORA utilizes a GNN model to handle large-scale boolean networks, as mentioned in **Response to Question 4**, our model of both 1-stage and 2-stage versions exhibits lower runtime memory usage compared to the GNN-based SOTA, so that we firmly believe that our model is capable of handling large-scale designs in GAMORA. In addition, our model is a preliminary exploration of the application of the point cloud transformer method in circuit design, using vanilla transformer. However, thanks to the active Transformer community, there are many methods that not only reduce computational complexity to linear but also improve accuracy. For example, LongNet [1] and RetNet [2], adding such methods to our model will bring better scalability to our model. With the rise of GPT, the use of Transformers for handling long sequential data (corresponding to large-scale circuit designs in the EDA field) has become a trend. There has been a wealth of research dedicated to improving the performance of Transformers while reducing computational complexity. We aim to bring this trend into the EDA domain, leveraging the advancements in Transformers to enhance circuit design tasks. [1] Ding, Jiayu, et al. "Longnet: Scaling transformers to 1,000,000,000 tokens." *arXiv preprint arXiv:2307.02486* (2023). [2] Sun, Yutao, et al. "Retentive Network: A Successor to Transformer for Large Language Models." *arXiv preprint arXiv:2307.08621* (2023). **Response to Question 6:** Thank you for your concerns. In the initial version of our paper, we only utilized the CircuitNet dataset. Therefore, Figure 3 (You refer to Figure 2, which is the architecture of grid-based attention (GA) module, we think it is a clerical error) presents the visualization of the predictions of various models on the congestion map of the CircuitNet dataset. We will clarify our descriptions in the revision to avoid misunderstanding. We hope the explanations provided above address your concerns. If they do, we kindly request you to reconsider your evaluation of this paper. Thank you for your valuable comments.

Reviewer YScf2023-08-20

Thank you for your responses. 1. I am aware that HybribNet [a] was a concurrent work. However, I am afraid that the comparison in this paper with a vital reference, CircuitGNN, (the most outstanding GNN model in this paper) is UNFAIR. One of the major claims is the proposed method could achieve better accuracy than CircuitGNN. In this case, both CircuitGNN and the proposed method should report the best possible accuracy, regardless of the epochs and settings. I am also aware other settings in [a] and this work are not quite the same, e.g., [a] used "AdamW optimizer for 500 epochs with an initial learning rate 2e-4", while this work used "100 epochs with a cosine annealing decay learning rate schedule [25] and 10-epoch warmup", and "AdamW optimizer with learning rate 0.001". However, if this work claims that it achieves better accuracy than CircuitGNN, the authors should report the best possible accuracy of both CitcuitGNN and this work. As far as we could know, to date, the CircuitGNN results in Table G1 are worse than CircuitGNN on ISPD 2015 dataset. In Table G1, the pearson, spearman, Kendall for CircuitGNN are 0.394, 0.1912, 0.1614 (100 epochs); while in work [a], the reported results of CirctuiGNN are pearson, spearman, Kendall are 0.413, 0.216, 0.189 (all higher than this work). 2. >We are aware that superblue12 is a design from the ISPD2015 dataset. We chose to use it for the runtime memory test because it is the largest design among all the designs in the ISPD2015 dataset and the CircuitNet dataset. In the same row of Table G5, it is misleading that the performance and runtime results are from two different datasets. Please justify in the very beginning when the Table was created. I would keep my score.

Authorsrebuttal2023-08-21

Thanks for your feedback

Thanks for your feedback. Regarding your further questions, we would like to provide some clarifications. **Response to Question 1:** Thank you for your kind reminder. We believe that your comparative approach can provide a more comprehensive evaluation of our model. However, we also believe that our previous comparison was fair. When reproducing CircuitGNN, we followed the same settings as outlined in the original paper, with a training duration of 100 epochs. Similarly, our model was also trained for 100 epochs. Certainly, as you mentioned, it is important to compare our model with the currently reproduced SOTA CircuitGNN in HybridNet. We have already started training a version of our model for 500 epochs. However, due to the time constraints for the rebuttal, we were unable to obtain the results within the given time. We will report the results in the final version of the paper. Here, we compared the performance of our model trained for 100 epochs with CircuitGNN on the ISPD2015 dataset. The experimental results are presented in Table R1. The experimental results show that our 100-epoch-trained model outperformed the 500-epoch-trained CircuitGNN by 28.2% in terms of the average metric. We believe that with a more extensive training of 500 epochs, our model will achieve better results. | Method | training epochs | pearson | spearman | kendall | average | | ---------- | --------------- | ---------- | ---------- | ---------- | ------- | | CircuitGNN [39] | 100 | 0.3940 | 0.1912 | 0.1614 | 0.2489 | | CircuitGNN [39] | 500 | 0.4130 | 0.2160 | **0.1890** | 0.2727 | | Ours | 100 | **0.6534** | **0.2244** | 0.1710 | **0.3496** | Table R1. Results of models with different numbers of training epochs on the ISPD2015 congestion prediction task **Response to Question 2:** Thank you for your kind reminder. We chose superblue12 as a runtime memory test because you were concerned that our model could not handle million-level designs. However, we acknowledge that the designs in CircuitNet are relatively small, with the largest design, RISCY-FPU-a, consisting of only 77,707 nodes, could not prove that our model could handle large-scale designs. This could lead to some misunderstandings, as you say, so we report the runtime memory in processing the RISCY-FPU-a design in Table R2. The results confirm our previous conclusion that both the 1-stage and 2-stage versions of our model exhibit lower runtime memory usage compared to the SOTA GNN-based model (CircuitGNN). | Method | pearson | spearman | kendall | Runtime Memory/MB | | --------------- | ------- | -------- | ------- | ----------------- | | Ours (4-stage) | 0.6374 | 0.5282 | 0.3935 | 2475 | | Ours (3-stage) | 0.5793 | 0.4977 | 0.3683 | 1519 | | Ours (2-stage) | 0.5322 | 0.4972 | 0.3668 | 1047 | | Ours (1-stage) | 0.5260 | 0.4853 | 0.3582 | 811 | | CircuitGNN [39] | 0.3287 | 0.4483 | 0.3688 | 1501 | Table R2. The performance of models with different numbers of stages on the CircuitNet congestion prediction task, and their runtime memory during the processing of RISCY-FPU-a, which consists of 77,707 nodes.

Program Chairsdecision2023-09-21

Decision

Accept (poster)

© 2026 NYSGPT2525 LLC