Youngchang Choi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Youngchang Choi has a total of 17 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
7 shared publications - Kyongsu Lee
Department of Electrical Engineering, Pohang University of Science and Technology, Pohang, South Korea
2 shared publications Minjeong Choi
Electrical Engineering Department, Pohang University of Science and Technology, Pohang, South Korea
2 shared publicationsEunji Kwon
EE Department, POSTECH, Pohang, South Korea
1 shared publication- Ho-Jin Lee
POSTECH, Pohang, Republic of Korea
1 shared publication - Hyunjeong Kwon
Electrical Engineering Department, Pohang University of Science and Technology, Pohang, South Korea
1 shared publication
Latest Publications
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
GTX: Graph Transformer for Parasitic EXtraction on Analog Circuits
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessGTX: Graph Transformer for Parasitic EXtraction on Analog Circuits
- Open Access
- 20 January 2025
- Published by Association for Computing Machinery (ACM)
- p. 842-848
PC-Opt: Partition and Conquest-based Optimizer using Multi-Agents for Complex Analog Circuits
Recent research in electronic design automation (EDA) tools has focused on utilizing artificial intelligence (AI) for sizing analog circuit designs. Still, there has been a lack of focus on optimizing complex analog circuits. To optimize complex analog circuits within a few circuit simulations, we propose a partition-and-conquest-based optimizer (PC-Opt). PC-Opt assigns distinct actor-critic roles within a multi-agent system, facilitating the partitioning of complex analog circuits and conquering their optimization challenges. Partial differential training is developed for the proper prediction of each actor, which merges each other and then predicts the optimized entire circuit. To generate a compact and non-biased dataset for network training, a concentrated sampling method is devised. Experimental results on three circuits demonstrate the effectiveness of PC-Opt.
- 20 January 2025
- Published by Association for Computing Machinery (ACM)
- p. 842-848
Open AccessPC-Opt: Partition and Conquest-based Optimizer using Multi-Agents for Complex Analog Circuits
Recent research in electronic design automation (EDA) tools has focused on utilizing artificial intelligence (AI) for sizing analog circuit designs. Still, there has been a lack of focus on optimizing complex analog circuits. To optimize complex analog circuits within a few circuit simulations, we propose a partition-and-conquest-based optimizer (PC-Opt). PC-Opt assigns distinct actor-critic roles within a multi-agent system, facilitating the partitioning of complex analog circuits and conquering their optimization challenges. Partial differential training is developed for the proper prediction of each actor, which merges each other and then predicts the optimized entire circuit. To generate a compact and non-biased dataset for network training, a concentrated sampling method is devised. Experimental results on three circuits demonstrate the effectiveness of PC-Opt.
- 23 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 71 (5) , 2045-2056
MA-Opt: Reinforcement Learning-Based Analog Circuit Optimization Using Multi-Actors
There is a need for electronic design automation (EDA) tools for analog circuit design since analog circuit design requires substantial human effort and expertise. Using reinforcement learning (RL)-inspired methodologies, this study presents MA-Opt, an analog circuit optimizer. We propose MA-Opt to provide multiple predictions of optimized circuit designs through the use of multiple actors. Multiple actors can be exploited effectively by sharing a memory that affects the loss function of network training, resulting in an accelerated optimization of circuits. Furthermore, we introduce a cooperative near-sampling method deploying a synergistic effect and then optimizing the design. The efficiency of MA-Opt was demonstrated by simulating three analog circuits and comparing the results to other methods. In the experiment, the use of multiple actors with a shared elite solution set and the cooperative near-sampling method proved to be effective. MA-Opt achieved minimum target metrics up to 34 $\%$ better than DNN-Opt within the same number of simulations while satisfying all given constraints. Moreover, at identical runtime, MA-Opt exhibited better Figure of Merits (FoMs) in comparison to DNN-Opt.
- 23 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 71 (5) , 2045-2056
MA-Opt: Reinforcement Learning-Based Analog Circuit Optimization Using Multi-Actors
There is a need for electronic design automation (EDA) tools for analog circuit design since analog circuit design requires substantial human effort and expertise. Using reinforcement learning (RL)-inspired methodologies, this study presents MA-Opt, an analog circuit optimizer. We propose MA-Opt to provide multiple predictions of optimized circuit designs through the use of multiple actors. Multiple actors can be exploited effectively by sharing a memory that affects the loss function of network training, resulting in an accelerated optimization of circuits. Furthermore, we introduce a cooperative near-sampling method deploying a synergistic effect and then optimizing the design. The efficiency of MA-Opt was demonstrated by simulating three analog circuits and comparing the results to other methods. In the experiment, the use of multiple actors with a shared elite solution set and the cooperative near-sampling method proved to be effective. MA-Opt achieved minimum target metrics up to 34 $\%$ better than DNN-Opt within the same number of simulations while satisfying all given constraints. Moreover, at identical runtime, MA-Opt exhibited better Figure of Merits (FoMs) in comparison to DNN-Opt.
- 25 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 47-48
Soft Actor-Critic Reinforcement Learning-Based Optimization for Analog Circuit Sizing
This research proposes a Soft Actor-Critic (SAC) based RL approach to optimize analog circuit sizing. The SAC algorithm efficiently addresses challenges in continuous state and action spaces, providing stable learning and sample efficiency. Comparative experiments were conducted on a 2-stage OTA and a 3-stage TIA, showing that SAC outperforms DDPG and TD3 in terms of success rate, average FoM, and minimum power consumption. The results demonstrate the effectiveness of the proposed SAC-based RL architecture for analog circuit optimization.
- 25 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 47-48
Soft Actor-Critic Reinforcement Learning-Based Optimization for Analog Circuit Sizing
This research proposes a Soft Actor-Critic (SAC) based RL approach to optimize analog circuit sizing. The SAC algorithm efficiently addresses challenges in continuous state and action spaces, providing stable learning and sample efficiency. Comparative experiments were conducted on a 2-stage OTA and a 3-stage TIA, showing that SAC outperforms DDPG and TD3 in terms of success rate, average FoM, and minimum power consumption. The results demonstrate the effectiveness of the proposed SAC-based RL architecture for analog circuit optimization.
- 9 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Reinforcement Learning-based Analog Circuit Optimizer using gm/ID for Sizing
Designing analog circuits incurs high time costs because designers must consider numerous design variables or trade-off relationships of circuit performance based on a lot of knowledge and experience. To reduce design time, various machine learning methods have been used to optimize analog circuits by learning the correlation between the device size and the circuit performance. However, it is difficult to train the correlation because of its high non-linearity and wide design space. In this paper, this study proposes a new framework to optimize analog circuit designs by combining reinforcement learning (RL) and the sensitivity analysis with g m /I D sizing, which is more intuitive for interpreting circuit performance. Furthermore, the universal value function approximator (UVFA), previously proposed in RL, is modified more simply to make it easier to find the target design. Additionally, the dataset is rearranged and sampled by the criteria that are established based on the principle of circuit operation, which helps to orient the agent to learn the circuit operation. Using the proposed methods, we optimize three types of differential amplifiers with common mode feedback circuits and obtain the best circuit design. Compared to baseline, we find the optimal point using modified UVFA, and moreover, reduce the number of iterations by 42.2%, 39.5%, and 37.5%, respectively, for the three test cases.
- 9 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Reinforcement Learning-based Analog Circuit Optimizer using gm/ID for Sizing
Designing analog circuits incurs high time costs because designers must consider numerous design variables or trade-off relationships of circuit performance based on a lot of knowledge and experience. To reduce design time, various machine learning methods have been used to optimize analog circuits by learning the correlation between the device size and the circuit performance. However, it is difficult to train the correlation because of its high non-linearity and wide design space. In this paper, this study proposes a new framework to optimize analog circuit designs by combining reinforcement learning (RL) and the sensitivity analysis with g m /I D sizing, which is more intuitive for interpreting circuit performance. Furthermore, the universal value function approximator (UVFA), previously proposed in RL, is modified more simply to make it easier to find the target design. Additionally, the dataset is rearranged and sampled by the criteria that are established based on the principle of circuit operation, which helps to orient the agent to learn the circuit operation. Using the proposed methods, we optimize three types of differential amplifiers with common mode feedback circuits and obtain the best circuit design. Compared to baseline, we find the optimal point using modified UVFA, and moreover, reduce the number of iterations by 42.2%, 39.5%, and 37.5%, respectively, for the three test cases.
- 26 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 68 (8) , 2947-2951
Low-Power Ternary Multiplication Using Approximate Computing
We propose a novel approximate computing technique for low-power ternary multiplication. A carry-truncated ternary multiplier, error compensation circuits, and 2 ×2 ternary multipliers with various accuracies are proposed using the low-power design methodology with carbon nanotube FETs. An accuracy-configurable design method is proposed to design energy-efficient 6 ×6 approximate ternary multipliers. The energy benefit of the proposed 6 ×6 approximate ternary multipliers have been verified using HSPICE simulation. The proposed approximate design shows 82.8% power-delay product with 41.8% mean absolute percentage error improvement over the previous approximate multiplier-based design. Image processing applications are conducted using the proposed approximate designs to confirm that the accuracy of ternary multiplication is satisfied the user's requirement.
- 26 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 68 (8) , 2947-2951
Low-Power Ternary Multiplication Using Approximate Computing
We propose a novel approximate computing technique for low-power ternary multiplication. A carry-truncated ternary multiplier, error compensation circuits, and 2 ×2 ternary multipliers with various accuracies are proposed using the low-power design methodology with carbon nanotube FETs. An accuracy-configurable design method is proposed to design energy-efficient 6 ×6 approximate ternary multipliers. The energy benefit of the proposed 6 ×6 approximate ternary multipliers have been verified using HSPICE simulation. The proposed approximate design shows 82.8% power-delay product with 41.8% mean absolute percentage error improvement over the previous approximate multiplier-based design. Image processing applications are conducted using the proposed approximate designs to confirm that the accuracy of ternary multiplication is satisfied the user's requirement.
- 1 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1344-1349
MDARTS: Multi-objective Differentiable Neural Architecture Search
In this work, we present a differentiable neural architecture search (NAS) method that takes into account two competing objectives, quality of result (QoR) and quality of service (QoS) with hardware design constraints. NAS research has recently received a lot of attention due to its ability to automatically find architecture candidates that can outperform handcrafted ones. However, the NAS approach which complies with actual HW design constraints has been under-explored. A naive NAS approach for this would be to optimize a combination of two criteria of QoR and QoS, but the simple extension of the prior art often yields degenerated architectures, and suffers from a sensitive hyperparameter tuning. In this work, we propose a multi-objective differential neural architecture search, called MDARTS. MDARTS has an affordable search time and can find Pareto frontier of QoR versus QoS. We also identify the problematic gap between all the existing differentiable NAS results and those final post-processed architectures, where soft connections are binarized. This gap leads to performance degradation when the model is deployed. To mitigate this gap, we propose a separation loss that discourages indefinite connections of components by implicitly minimizing entropy.
- 1 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1344-1349
MDARTS: Multi-objective Differentiable Neural Architecture Search
In this work, we present a differentiable neural architecture search (NAS) method that takes into account two competing objectives, quality of result (QoR) and quality of service (QoS) with hardware design constraints. NAS research has recently received a lot of attention due to its ability to automatically find architecture candidates that can outperform handcrafted ones. However, the NAS approach which complies with actual HW design constraints has been under-explored. A naive NAS approach for this would be to optimize a combination of two criteria of QoR and QoS, but the simple extension of the prior art often yields degenerated architectures, and suffers from a sensitive hyperparameter tuning. In this work, we propose a multi-objective differential neural architecture search, called MDARTS. MDARTS has an affordable search time and can find Pareto frontier of QoR versus QoS. We also identify the problematic gap between all the existing differentiable NAS results and those final post-processed architectures, where soft connections are binarized. This gap leads to performance degradation when the model is deployed. To mitigate this gap, we propose a separation loss that discourages indefinite connections of components by implicitly minimizing entropy.