Yan Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Yan Wang has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Benyuan Chen
National “111 Research Center” Microelectronics and Integrated Circuits, School of Science, Hubei University of Technology, Wuhan 430068, China
1 shared publication - Cheng Zhang
National “111 Research Center” Microelectronics and Integrated Circuits, School of Science, Hubei University of Technology, Wuhan 430068, China
1 shared publication - Hui Lv
School of Physics and Electromechanical Engineering, Hubei University of Education, Wuhan 430205, China
1 shared publication - Jie Chen
National “111 Research Center” Microelectronics and Integrated Circuits, School of Science, Hubei University of Technology, Wuhan 430068, China
1 shared publication - Juan Li
National “111 Research Center” Microelectronics and Integrated Circuits, School of Science, Hubei University of Technology, Wuhan 430068, China
1 shared publication - Qinghua Lv
School of Science, Hubei University of Technology, Wuhan 430068, China
1 shared publication
Latest Publications
- Open Access
- 25 April 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (5) , 249
A Method for Synthesizing Ultra-Large-Scale Clock Trees
As integrated circuit technology continues to advance, clock tree synthesis has become increasingly significant in the design of ultra-large-scale integrated circuits. Traditional clock tree synthesis methods often face challenges such as insufficient computational resources and buffer fan-out limitations when dealing with ultra-large-scale clock trees. To address this issue, this paper proposes an improved clock tree synthesis algorithm called incomplete balanced KSR (IB-KSR). Building upon the KSR algorithm, this proposed algorithm efficiently reduces the consumption of computational resources and constrains the fan-out of each buffer by incorporating incomplete minimum spanning tree (IMST) technology and a clustering strategy grounded in Balanced Split. In experiments, the IB-KSR algorithm was compared with the GSR algorithm. The results indicated that IB-KSR reduced the global skew of the clock tree by 43.4% and decreased the average latency by 34.3%. Furthermore, during program execution, IB-KSR maintained low computational resource consumption.
- 25 April 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (5) , 249
Open AccessA Method for Synthesizing Ultra-Large-Scale Clock Trees
As integrated circuit technology continues to advance, clock tree synthesis has become increasingly significant in the design of ultra-large-scale integrated circuits. Traditional clock tree synthesis methods often face challenges such as insufficient computational resources and buffer fan-out limitations when dealing with ultra-large-scale clock trees. To address this issue, this paper proposes an improved clock tree synthesis algorithm called incomplete balanced KSR (IB-KSR). Building upon the KSR algorithm, this proposed algorithm efficiently reduces the consumption of computational resources and constrains the fan-out of each buffer by incorporating incomplete minimum spanning tree (IMST) technology and a clustering strategy grounded in Balanced Split. In experiments, the IB-KSR algorithm was compared with the GSR algorithm. The results indicated that IB-KSR reduced the global skew of the clock tree by 43.4% and decreased the average latency by 34.3%. Furthermore, during program execution, IB-KSR maintained low computational resource consumption.