SLSoo Hyung Lee

Soo Hyung Lee

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Soo Hyung Lee has a total of 31 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • An Analysis of Components and Enhancement Strategies for Advancing Memristive Neural Networks

    by Hyungjun Park, Joon‐Kyu Han, Seongpil Yim, Dong Hoon Shin, Tae Won Park, Kyung Seok Woo, Soo Hyung Lee, Jae Min Cho, Hyun Wook Kim, Taegyun Park, et al.

    Advancements in artificial intelligence (AI) and big data have highlighted the limitations of traditional von Neumann architectures, such as excessive power consumption and limited performance improvement with increasing parameter numbers. These challenges are significant for edge devices requiring higher energy and area efficiency. Recently, many reports on memristor‐based neural networks (Mem‐NN) using resistive switching memory have shown efficient computing performance with a low power requirement. Even further performance optimization can be made using engineering resistive switching mechanisms. Nevertheless, systematic reviews that address the circuit‐to‐material aspects of Mem‐NNs, including their dedicated algorithms, remain limited. This review first categorizes the memristor‐based neural networks into three components: pre‐processing units, processing units, and learning algorithms. Then, the optimization methods to improve integration and operational reliability are discussed across materials, devices, circuits, and algorithms for each component. Furthermore, the review compares recent advancements in chip‐level neuromorphic hardware with conventional systems, including graphic processing units. The ongoing challenges and future directions in the field are discussed, highlighting the research to enhance the functionality and reliability of Mem‐NNs.


  • In‐Materia Annealing and Combinatorial Optimization Based on Vertical Memristive Array

    by Soo Hyung Lee, Sunwoo Cheong, Jea Min Cho, Néstor Ghenzi, Dong Hoon Shin, Yoon Ho Jang, Janguk Han, Tae Won Park, Dong Yun Kim, Sung Keun Shim, et al.

    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.


  • Memristive Crossbar Array‐Based Probabilistic Graph Modeling

    by Yoon Ho Jang, Soo Hyung Lee, Janguk Han, Sunwoo Cheong, Sung Keun Shim, Joon‐Kyu Han, Seung Kyu Ryoo, Cheol Seong Hwang

    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

    Implementation of Bayesian networks and Bayesian inference using a Cu0.1Te0.9/HfO2/Pt threshold switching memristor

    by In Kyung Baek, Soo Hyung Lee, Yoon Ho Jang, Hyungjun Park, Jaehyun Kim, Sunwoo Cheong, Sung Keun Shim, Janguk Han, Joon-Kyu Han, Gwang Sik Jeon, et al.

    Implementation of Bayesian networks and Bayesian inference using a Cu0.1Te0.9/HfO2/Pt threshold switching memristor.


  • Spatiotemporal Data Processing with Memristor Crossbar‐Array‐Based Graph Reservoir

    by Yoon Ho Jang, Soo Hyung Lee, Janguk Han, Woohyun Kim, Sung Keun Shim, Sunwoo Cheong, Kyung Seok Woo, Joon‐Kyu Han, Cheol Seong Hwang

    Memristor‐based physical reservoir computing (RC) is a robust framework for processing complex spatiotemporal data parallelly. However, conventional memristor‐based reservoirs cannot capture the spatial relationship between the time‐varying inputs due to the specific mapping scheme assigning one input signal to one memristor conductance. Here, a physical “graph reservoir” is introduced using a metal cell at the diagonal‐crossbar array (mCBA) with dynamic self‐rectifying memristors. Input and inverted input signals are applied to the word and bit lines of the mCBA, respectively, storing the correlation information between input signals in the memristors. In this way, the mCBA graph reservoirs can map the spatiotemporal correlation of the input data in a high‐dimensional feature space. The high‐dimensional mapping characteristics of the graph reservoir achieve notable results, including a normalized root‐mean‐square error of 0.09 in Mackey–Glass time series prediction, a 97.21% accuracy in MNIST recognition, and an 80.0% diagnostic accuracy in human connectome classification.


  • Parallel Density‐Based Spatial Clustering with Dual‐Functional Memristive Crossbar Array

    by Sunwoo Cheong, Dong Hoon Shin, Soo Hyung Lee, Yoon Ho Jang, Taegyun Park, Janguk Han, Sung Keun Shim, Yeong Rok Kim, Joon‐Kyu Han, Néstor Ghenzi, et al.

    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.