Daeyeon Kim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Daeyeon Kim has a total of 175 co-authors. Here are the top co-authors by number of shared publications:
- Seokhyeong Kang
Pohang University of Science and Technology, Pohang, Gyeongbuk, Republic of Korea
4 shared publications - Sung-Yun Lee
Department of Electrical Engineering, Pohang University of Science and Technology, 77 Cheongam-ro, Nam-gu, Pohang, Gyeongbuk, 37673, Republic of Korea
2 shared publications - Abdullah Sulieman Terkawi
Department of Anesthesiology, Perioperative and Pain Medicine, Stanford University School of Medicine, Palo Alto, CA, USA
1 shared publication - Alfred I. Neugut
Columbia University
1 shared publication - Ali Khatibi
Department of Psychology, University of Bath, Bath, UK
1 shared publication - Alison G. Cahill
The University of Texas at Austin, Dell Medical School, Austin, TX
1 shared publication
Latest Publications
- Open Access
- 2 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Invited: Acceleration on Physical Design: Machine Learning-based Routability Optimization
Design rule violation (DRV) is one of the significant challenges in designing integrated circuits. To successfully manufacture a chip, it is crucial to create a DRV clean layout. However, as technology nodes shrink and the cell density of the design increases, design rules have become increasingly difficult to meet, making the routing more complex. In addition, the conventional design flow has a problem in that it primarily determines design parameters and tool options, while evaluating routability at the end of the design flow. Furthermore, due to complex design rules, even global routers are not accurate enough, so routability can be assessed after actual routing, leading to significantly extended design turn-around times. In this paper, we introduce a framework that leverages machine learning techniques to overcome the limitations of the conventional design flows. We also present the challenges that arise during the construction of the framework, along with related research. Furthermore, we discuss issues that remain unresolved.
- 2 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessInvited: Acceleration on Physical Design: Machine Learning-based Routability Optimization
Design rule violation (DRV) is one of the significant challenges in designing integrated circuits. To successfully manufacture a chip, it is crucial to create a DRV clean layout. However, as technology nodes shrink and the cell density of the design increases, design rules have become increasingly difficult to meet, making the routing more complex. In addition, the conventional design flow has a problem in that it primarily determines design parameters and tool options, while evaluating routability at the end of the design flow. Furthermore, due to complex design rules, even global routers are not accurate enough, so routability can be assessed after actual routing, leading to significantly extended design turn-around times. In this paper, we introduce a framework that leverages machine learning techniques to overcome the limitations of the conventional design flows. We also present the challenges that arise during the construction of the framework, along with related research. Furthermore, we discuss issues that remain unresolved.
- 28 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 42 (6) , 2030-2042
Construction of Realistic Place-and-Route Benchmarks for Machine Learning Applications
Many design optimization methods using machine learning (ML) techniques have been investigated to reduce the number of design iterations in the physical design flow. The demand for big data to support ML research has been increasing, but the lack of place-and-route (P&R) benchmarks is one of the major problems. We propose a framework to construct realistic P&R benchmarks for use in training ML applications. The framework can organize the P&R database using an artificial netlist generator, which can create any gate-level netlist from user-specified input parameters that represent the topological characteristics of the circuit. We show that a training dataset that contains many artificial gate-level netlists can improve the generalizability of the model to predict the routability for unseen real circuits without using expensive real-world data. Compared to the model that had been trained with real-world circuits, we improved the F1 score in predicting the timing and routing failure by 26.4% and 54.5%, respectively.
- 28 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 42 (6) , 2030-2042
Construction of Realistic Place-and-Route Benchmarks for Machine Learning Applications
Many design optimization methods using machine learning (ML) techniques have been investigated to reduce the number of design iterations in the physical design flow. The demand for big data to support ML research has been increasing, but the lack of place-and-route (P&R) benchmarks is one of the major problems. We propose a framework to construct realistic P&R benchmarks for use in training ML applications. The framework can organize the P&R database using an artificial netlist generator, which can create any gate-level netlist from user-specified input parameters that represent the topological characteristics of the circuit. We show that a training dataset that contains many artificial gate-level netlists can improve the generalizability of the model to predict the routability for unseen real circuits without using expensive real-world data. Compared to the model that had been trained with real-world circuits, we improved the F1 score in predicting the timing and routing failure by 26.4% and 54.5%, respectively.
- Open Access
- 7 March 2022
- Published by SPIE-Intl Soc Optical Eng
- p. 60
Investigation of nonlinear optical properties of para-toluene sulfonate by using Z-scan technique
SPIE Digital Library Proceedings
- 7 March 2022
- Published by SPIE-Intl Soc Optical Eng
- p. 60
Open AccessInvestigation of nonlinear optical properties of para-toluene sulfonate by using Z-scan technique
SPIE Digital Library Proceedings
- 2 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 68 (4) , 1567-1577
Variation-Aware SRAM Cell Optimization Using Deep Neural Network-Based Sensitivity Analysis
Under process, voltage, and temperature variations, SRAM cell stability largely fluctuates from the nominal value. In the design step, SRAM cell optimization while ignoring the fluctuation induces the yield loss for the stability. Variation-aware optimization of an SRAM cell can prevent the yield loss problem by considering the mean and variance of SRAM cell stability when finding optimal design parameters. This paper proposes a novel SRAM optimization method that uses a deep neural network (DNN). Multiple DNNs from ensemble techniques represent the mean and variance of SRAM cell stability for the nominal design parameters. Subsequent sensitivity analysis of DNN extracts the ${K}$ design parameters that have the most dominant effects on the mean and variance of SRAM cell stability. Then multidimensional optimization is used to find the optimal values of these ${K}$ parameters to maximize the mean stability while minimizing its variance. The proposed method achieved an average of 2% error compared to MC simulation. The proposed optimization method takes only 561 s to provide the most optimal design parameter values of an SRAM cell.
- 2 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 68 (4) , 1567-1577
Variation-Aware SRAM Cell Optimization Using Deep Neural Network-Based Sensitivity Analysis
Under process, voltage, and temperature variations, SRAM cell stability largely fluctuates from the nominal value. In the design step, SRAM cell optimization while ignoring the fluctuation induces the yield loss for the stability. Variation-aware optimization of an SRAM cell can prevent the yield loss problem by considering the mean and variance of SRAM cell stability when finding optimal design parameters. This paper proposes a novel SRAM optimization method that uses a deep neural network (DNN). Multiple DNNs from ensemble techniques represent the mean and variance of SRAM cell stability for the nominal design parameters. Subsequent sensitivity analysis of DNN extracts the ${K}$ design parameters that have the most dominant effects on the mean and variance of SRAM cell stability. Then multidimensional optimization is used to find the optimal values of these ${K}$ parameters to maximize the mean stability while minimizing its variance. The proposed method achieved an average of 2% error compared to MC simulation. The proposed optimization method takes only 561 s to provide the most optimal design parameter values of an SRAM cell.
- 3 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 39 (8) , 1744-1749
Compact Topology-Aware Bus Routing for Design Regularity
In bus routing, if signal bits in a bus structure share a common routing topology, routability is increased by avoiding twisted patterns and variation immunity. The bus routing problem has become significantly important because of increasing complexity of bus structures for multi-chip-module, I/O pins, or on-chip memories in advanced technology. We present and evaluate a compact topology-aware bus routing method that can both compactly synthesize the routing topology of the bus and minimize design rule violations even in designs with high bus density and high track utilization. Our proposed method completed the bus routing in the runtime limit of the ICCAD-2018 contest and achieved 66% reduction in total cost compared with the winner of that contest.
- 3 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 39 (8) , 1744-1749
Compact Topology-Aware Bus Routing for Design Regularity
In bus routing, if signal bits in a bus structure share a common routing topology, routability is increased by avoiding twisted patterns and variation immunity. The bus routing problem has become significantly important because of increasing complexity of bus structures for multi-chip-module, I/O pins, or on-chip memories in advanced technology. We present and evaluate a compact topology-aware bus routing method that can both compactly synthesize the routing topology of the bus and minimize design rule violations even in designs with high bus density and high track utilization. Our proposed method completed the bus routing in the runtime limit of the ICCAD-2018 contest and achieved 66% reduction in total cost compared with the winner of that contest.
- 1 September 2012
- Published by Elsevier in American Journal of Obstetrics and Gynecology
- Vol. 207 (3) , A1-A14
Table of Contents
- 1 September 2012
- Published by Elsevier in American Journal of Obstetrics and Gynecology
- Vol. 207 (3) , A1-A14
Table of Contents
- 1 January 2012
- Published by Elsevier
- p. 1477-1481
Monitoring and fault diagnosis system for LNG fractionation process
- 1 January 2012
- Published by Elsevier
- p. 1477-1481
Monitoring and fault diagnosis system for LNG fractionation process