Miao Liu

Miao Liu

Auto-generated profile, based on publicly available information

Miao Liu

University of the Chinese Academy of Sciences

Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 March 2026 in ACM Transactions on Design Automation of Electronic Systems
Verified
Journal Article
Open access
YCYe Cai
Ye Cai
RWRui Wang
Rui Wang
LNLiwei Ni
Liwei Ni
MLMiao Liu
Miao Liu
XMXingyu Meng
Xingyu Meng
XLXingquan Li
Xingquan Li
Logic Optimization (LO) is a critical stage in the chip design process, focused on improving the Quality of Results (QoR) by optimizing circuit designs to minimize area and delay. During logic optimization, evaluating the QoR after each iteration requires completing logic optimization and technology mapping. The evaluation process is highly time-consuming, restricting the number of optimization iterations possible within a given time. To address this, the AI-aided logic optimization framework (AiLO) is developed to explore more optimization operator sequences (recipes). AiLO framework consists of two core components: AI-based metric evaluation and optimization exploration. To achieve accurate evaluation, different prediction models can be integrated. A multi-scale cross-attention Transformer (CrossLO) is introduced to simulate the optimization structure of recipes across circuit at various scales to enhance the prediction accuracy. Moreover, the AI evaluation module can effectively maintain the recipe ranking, even when prediction accuracy is biased. The logic optimization exploration algorithm integrated with CrossLO (AI evaluation) shows an average improvement of 14.75% over the initial version. NSGA-II (optimization module) integrated with CrossLO achieves a significant lead over other algorithms in the same time. In addition, the AiLO framework continues to grow with the performance of the two components, demonstrating strong adaptability and flexibility.

10 February 2026 in ACM Transactions on Design Automation of Electronic Systems
Verified
Journal Article
Open access
XLXinhua Lai
Xinhua Lai
MLMiao Liu
Miao Liu
XLXingquan Li
Xingquan Li
YQYihang Qiu
Yihang Qiu
SCShijian Chen
Shijian Chen
JXJungang Xu
Jungang Xu
Placement is a critical and time-consuming step in very-large-scale integration (VLSI) design flow. As placement methods continue to be researched, they introduce more parameters, making current methods for configuring parameters heavily reliant on human experience for each design. This article proposes a novel cross-design parameter optimization method, iPO, to accelerate parameter tuning without human involvement in different placement engines (like iEDA-iPL and DREAMPlace). Specifically, we introduce a heuristic strategy called Constant Liar to accelerate parameter tuning, allowing us to optimize parameters concurrently on different machines. Our research indicates that optimizing parameters for every design is time-consuming. To address the inefficiency of parameter tuning, we propose a cross-design parameter transfer learning strategy. This strategy measures the cosine similarity between designs in collaboration with a graph embedding algorithm representing netlists and cells. Compared with DREAMPlace on ISPD2015 benchmarks, our method achieves average improvements of 9.8% in half-perimeter wirelength (HPWL) and 12.0% in route congestion. When compared with AutoDMP, iPO shows an average improvement of 11% in HPWL and 12.3% in congestion, along with a 3.49× speed-up in the number of search iterations. Furthermore, we extended our experiments to the iEDA-28nm benchmarks, showing average improvements of 4.7%, 2.7% and 2.8% in HPWL, worst negative slack (WNS) and total negative slack (TNS), respectively, compared with iEDA-iPL. Finally, our ablation studies on parallelization demonstrate that using 10 parallel processes results in approximately an 18× speed-up compared with using a single process.

28 January 2026 in ACM Transactions on Design Automation of Electronic Systems
Verified
Journal Article
Open access
MLMiao Liu
Miao Liu
LNLiwei Ni
Liwei Ni
JLJunfeng Liu
Junfeng Liu
XMXingyu Meng
Xingyu Meng
RWRui Wang
Rui Wang
JXJungang Xu
Jungang Xu
The increasing complexity of digital circuits and the limitations of heuristic methods have led to growing interest in applying Machine Learning (ML) to Logic Synthesis (LS). ML provides a promising paradigm shift by implementing automated, scalable, and data-driven optimization strategies. This survey provides a comprehensive overview of the latest studies on ML approaches in LS, offering a deep understanding of the fundamental ML methods, and analyzing their strengths and limitations through systematic comparisons. We categorize existing works into two main types: ML-Assistance methods aiming at predicting performance metrics and reducing the cost of traditional simulations, and ML-Agent methods directly replacing heuristic processes in the LS flow. We further analyze ML methods and applications in different LS stages, including Boolean circuit generation, Boolean circuit analysis, logic optimization, and technology mapping, showing great achievements and improvement in exploring non-linear design spaces and discovering new optimization strategies. Finally, we discuss the challenges and limitations in the current situation and further provide a vision of future directions in LS.

1 November 2026 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
MLMiao Liu
Miao Liu
XLXinhua Lai
Xinhua Lai
LNLiwei Ni
Liwei Ni
XMXingyu Meng
Xingyu Meng
RWRui Wang
Rui Wang
JXJungang Xu
Jungang Xu
Graph neural networks have emerged as a powerful tool for learning circuit representation but largely ignore the dynamic nature of logic optimization (LO), leading to a severe “domain gap” where embedding quality degrades after heuristic transformations. To address this, we propose CircuitFlow, a framework learning representations for both circuits and optimization algorithms. CircuitFlow is distinguished by three features: (1) it employs circuit motifs and DAGTrans for robust encoding; (2) it utilizes a dual-component architecture where OPTrans models optimization operations via Transformers; and (3) it seamlessly integrates into LO pipelines to predict optimized circuit statistics.Experimental results demonstrate that CircuitFlow reduces physical metric prediction loss by up to 72% compared to baselines. Crucially, it effectively bridges the domain gap, bringing the generalization error on optimized circuits down from over 65% to within 20%. Furthermore, integrating CircuitFlow into the LO flow yields an average QoR improvement of 3.97% alongside a 3.11× speedup. Finally, we leverage CircuitFlow to introduce orientational logic optimization, a new paradigm guiding synthesis toward target structures, which reduces the runtime of Combinational Equivalence Checking (CEC) by 76% on average.

26 July 2026
Verified
Conference Paper
Open access
XLXinhua Lai
Xinhua Lai
HLHe Liu
He Liu
WLWeiguo Li
Weiguo Li
YQYihang Qiu
Yihang Qiu
MLMiao Liu
Miao Liu
JXJungang Xu
Jungang Xu