Sunwoo Cheong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sunwoo Cheong has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Cheol Seong Hwang
Seoul National University
4 shared publications - Soo Hyung Lee
Department of Materials Science and Engineering and Inter‐University Semiconductor Research Center College of Engineering Seoul National University Seoul 08826 Republic of Korea
4 shared publications - Dong Hoon Shin
Department of Materials Science and Engineering and Inter‐University Semiconductor Research Center Seoul National University Seoul 08826 Republic of Korea
3 shared publications - Janguk Han
Department of Materials Science and Engineering and Inter‐University Semiconductor Research Center College of Engineering Seoul National University Seoul 08826 Republic of Korea
3 shared publications - Joon-Kyu Han
Seoul National University
3 shared publications - Yoon Ho Jang
Department of Materials Science and Engineering and Inter‐University Semiconductor Research Center College of Engineering Seoul National University Seoul 08826 Republic of Korea
3 shared publications
Latest Publications
- 28 August 2024
- Published by Wiley in Advanced Materials
- Vol. 36 (40) , e2410191
In‐Materia Annealing and Combinatorial Optimization Based on Vertical Memristive Array
Due to its area and energy efficiency, a memristive crossbar array (CBA) has been extensively studied for various combinatorial optimization applications, from network problems to circuit design. However, conventional approaches include heavily burdening software fine‐tuning for the annealing process. Instead, this study introduces the “in‐materia annealing” method, where the inter‐layer interference of vertically stacked memristive CBA is utilized as an annealing method. When mapping combinatorial optimization problems into the configuration layer of the CBA, exponentially decaying annealing profiles are generated in nearby noise layers. Moreover, in‐materia annealing profiles can be controlled by changing compliance current, read voltage, and read pulse width. Therefore, the annealing profiles can be arbitrarily controlled and generated individually for each cell, providing rich noise sources to solve the problem efficiently. Consequently, the experimental and simulation of Max‐Cut and weighted Max‐Cut problems achieve notable results with the minimum software burden.
- 28 August 2024
- Published by Wiley in Advanced Materials
- Vol. 36 (40) , e2410191
In‐Materia Annealing and Combinatorial Optimization Based on Vertical Memristive Array
Due to its area and energy efficiency, a memristive crossbar array (CBA) has been extensively studied for various combinatorial optimization applications, from network problems to circuit design. However, conventional approaches include heavily burdening software fine‐tuning for the annealing process. Instead, this study introduces the “in‐materia annealing” method, where the inter‐layer interference of vertically stacked memristive CBA is utilized as an annealing method. When mapping combinatorial optimization problems into the configuration layer of the CBA, exponentially decaying annealing profiles are generated in nearby noise layers. Moreover, in‐materia annealing profiles can be controlled by changing compliance current, read voltage, and read pulse width. Therefore, the annealing profiles can be arbitrarily controlled and generated individually for each cell, providing rich noise sources to solve the problem efficiently. Consequently, the experimental and simulation of Max‐Cut and weighted Max‐Cut problems achieve notable results with the minimum software burden.
- 19 July 2024
- Published by Wiley in Advanced Materials
- Vol. 36 (36) , e2403904
Memristive Crossbar Array‐Based Probabilistic Graph Modeling
Modern graph datasets with structural complexity and uncertainties due to incomplete information or data variability require advanced modeling techniques beyond conventional graph models. This study introduces a memristive crossbar array (CBA)‐based probabilistic graph model (C‐PGM) utilizing Cu 0.3 Te 0.7 /HfO 2 /Pt memristors, which exhibit probabilistic switching, self‐rectifying, and memory characteristics. C‐PGM addresses the complexities and uncertainties inherent in structural graph data across various domains, leveraging the probabilistic nature of memristors. C‐PGM relies on the device‐to‐device variation across multiple memristive CBAs, overcoming the limitations of previous approaches that rely on sequential operations, which are slower and have a reliability concern due to repeated switching. This new approach enables the fast processing and massive implementation of probabilistic units at the expense of chip area. In this study, the hardware‐based C‐PGM feasibly expresses small‐scale probabilistic graphs and shows minimal error in aggregate probability calculations. The probability calculation capabilities of C‐PGM are applied to steady‐state estimation and the PageRank algorithm, which is implemented on a simulated large‐scale C‐PGM. The C‐PGM‐based steady‐state estimation and PageRank algorithm demonstrate comparable accuracy to conventional methods while significantly reducing computational costs.
- 19 July 2024
- Published by Wiley in Advanced Materials
- Vol. 36 (36) , e2403904
Memristive Crossbar Array‐Based Probabilistic Graph Modeling
Modern graph datasets with structural complexity and uncertainties due to incomplete information or data variability require advanced modeling techniques beyond conventional graph models. This study introduces a memristive crossbar array (CBA)‐based probabilistic graph model (C‐PGM) utilizing Cu 0.3 Te 0.7 /HfO 2 /Pt memristors, which exhibit probabilistic switching, self‐rectifying, and memory characteristics. C‐PGM addresses the complexities and uncertainties inherent in structural graph data across various domains, leveraging the probabilistic nature of memristors. C‐PGM relies on the device‐to‐device variation across multiple memristive CBAs, overcoming the limitations of previous approaches that rely on sequential operations, which are slower and have a reliability concern due to repeated switching. This new approach enables the fast processing and massive implementation of probabilistic units at the expense of chip area. In this study, the hardware‐based C‐PGM feasibly expresses small‐scale probabilistic graphs and shows minimal error in aggregate probability calculations. The probability calculation capabilities of C‐PGM are applied to steady‐state estimation and the PageRank algorithm, which is implemented on a simulated large‐scale C‐PGM. The C‐PGM‐based steady‐state estimation and PageRank algorithm demonstrate comparable accuracy to conventional methods while significantly reducing computational costs.
- Open Access
- 5 April 2024
- Published by Royal Society of Chemistry (RSC) in Nanoscale Advances
- Vol. 6 (11) , 2892-2902
Implementation of Bayesian networks and Bayesian inference using a Cu0.1Te0.9/HfO2/Pt threshold switching memristor
Implementation of Bayesian networks and Bayesian inference using a Cu0.1Te0.9/HfO2/Pt threshold switching memristor.
- 5 April 2024
- Published by Royal Society of Chemistry (RSC) in Nanoscale Advances
- Vol. 6 (11) , 2892-2902
Open AccessImplementation of Bayesian networks and Bayesian inference using a Cu0.1Te0.9/HfO2/Pt threshold switching memristor
Implementation of Bayesian networks and Bayesian inference using a Cu0.1Te0.9/HfO2/Pt threshold switching memristor.
- 12 November 2023
- Published by Wiley in Advanced Functional Materials
- Vol. 34 (8)
Parallel Density‐Based Spatial Clustering with Dual‐Functional Memristive Crossbar Array
Analog and digital switching performances in a Ta/HfO2/RuO2(THR) memristor are studied to implement a density‐based spatial clustering of applications with noise (DBSCAN) algorithm in a low‐power, parallel‐computing memristor crossbar structure. In the analog mode THR memristor, more than 256 states can be stored through a fine‐tuning process with a denoising scheme. The analog mode crossbar array facilitates Euclidean distance calculation between any points in the given graphic dataset. In the digital mode, the on/off ratio of more than three orders of magnitude between the binary states is achieved, providing functionality to cluster the data points with a reduced number of operations. The parallel computing capacity of the adopted crossbar decreases the time complexity of the original DBSCAN from O(n2) to O(n). Through array‐level simulations, the effectiveness of hardware functionality is validated using representative synthetic datasets and single‐cell RNA sequences datasets.
- 12 November 2023
- Published by Wiley in Advanced Functional Materials
- Vol. 34 (8)
Parallel Density‐Based Spatial Clustering with Dual‐Functional Memristive Crossbar Array
Analog and digital switching performances in a Ta/HfO2/RuO2(THR) memristor are studied to implement a density‐based spatial clustering of applications with noise (DBSCAN) algorithm in a low‐power, parallel‐computing memristor crossbar structure. In the analog mode THR memristor, more than 256 states can be stored through a fine‐tuning process with a denoising scheme. The analog mode crossbar array facilitates Euclidean distance calculation between any points in the given graphic dataset. In the digital mode, the on/off ratio of more than three orders of magnitude between the binary states is achieved, providing functionality to cluster the data points with a reduced number of operations. The parallel computing capacity of the adopted crossbar decreases the time complexity of the original DBSCAN from O(n2) to O(n). Through array‐level simulations, the effectiveness of hardware functionality is validated using representative synthetic datasets and single‐cell RNA sequences datasets.