DHDonghyun Han

Donghyun Han

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Donghyun Han has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A Dual-Mode Online BISR Architecture for Interconnect and Memory Repair in Chiplet-Based Systems

    by Donghyun Han, Sooryeong Lee, Jongho Park, Dayoung Kim, Seungtae Kim, Youngkwang Lee, Sungho Kang

    Chiplet-based systems provide a scalable platform for heterogeneous integration, but permanent faults in interconnects and memory cells challenge their reliability. While standards like Universal Chiplet Interconnect Express (UCIe) employ single-domain system Error Correction Code (ECC) simplify architecture, they often limit fault isolation and recovery. This paper proposes a dual-mode Online Built-In Self-Repair (OBISR) architecture for unified detection and repair of both interconnect and memory faults during post-bond testing and in-field operation. Unlike conventional methods that merely expand ECC capacity, the OBISR targets the root causes of persistent errors by repurposing existing Content-Addressable Memory (CAM) and pathfinding logic. A hierarchical CAM structure classifies faults using spatial and recurrence patterns of ECC metadata to distinguish permanent defects from transients. Memory faults are masked via logical redirection, while interconnect faults are rerouted, both operating outside the datapath to ensure zero performance degradation. Evaluations demonstrate that the OBISR improves system-level resilience by 235.49% and reduces hardware area by 16.69% compared to conventional schemes. Its integrated dual-domain and dual-mode capabilities offer a robust, scalable solution for next-generation chiplet reliability.

  • Test Cycle Reduction for TSV Test Using Streaming Scan Network on 3-D IC

    by Sunghoon Kim, Donghyun Han, Dayoung Kim, Sungho Kang

    Through-silicon vias (TSVs) are essential for interdie connections in 3-D integrated circuits (3-D ICs), but their susceptibility to defects necessitates effective testing. As the correct operation of TSVs is critical to the overall reliability of 3-D ICs, their testing is regarded as an essential part of the 3-D IC testing process. Conventional TSV testing based on the IEEE-1838 standard architecture often increases test cycles due to the serial data application through die wrapper registers (DWRs). In this brief, an architecture is proposed that enables efficient TSV testing by using the streaming scan network (SSN) architecture, which is already utilized for logic core testing. TSV groups are treated as identical cores, allowing parallel application of test patterns via the SSN bus and streaming scan host (SSH). The experimental results show that the proposed method achieves a significant reduction in test cycles compared with the conventional TSV test method based on the IEEE-1838 standard architecture, without incurring a noticeable increase in area overhead. The reduction in test cycles becomes more pronounced as the number of TSVs increases.

  • Open Access

    Low Cost TSV Repair Architecture Using Switch-Based Matrix for Highly Clustered Faults

    by Seokjun Jang, Donghyun Han, Sunghoon Kim, Dayoung Kim, Sungho Kang

    Through-silicon via (TSV), responsible for inter-layer communication in high-bandwidth memory (HBM), plays a critical role in HBM operation. Therefore, faults occur in TSVs can critically impact the entire chips. However, due to their structural characteristics, TSVs are prone to faults occurring both during the manufacturing process and after sale. Accordingly, numerous studies have been conducted on TSV repair methods to ensure TSV reliability. These studies have focused on improving repair rates for the faults occurring within a single TSV repair group. Recent studies have achieved an optimal repair rate by repairing faulty TSVs (FTSVs) up to the number of redundant TSVs (RSTVs) inserted. However, actual faults tend to cluster within TSV repair groups rather than being evenly distributed. In response, this paper proposes a low cost TSV repair architecture (LCTRA) that, while slightly reducing the repair rate for evenly distributed faults, is optimized for repairing highly clustered faults. The proposed method achieves high repair performance for the highly clustered faults with lower area and delay overhead compared to conventional methods, and the repair performance is quantitatively demonstrated through experimental results in various environments.

  • SPOT: Fast and Optimal Built-In Redundancy Analysis Using Smart Potential Case Collection

    by Donghyun Han, Sunghoon Kim, Dayoung Kim, Sungho Kang

    With advancements in manufacturing and design technology, memory integration density has improved. However, as integration density increases, the cost of testing and repairing memory has also risen, posing a significant challenge in memory production. To address this challenge, built-in self-repair (BISR) has been proposed. Traditional built-in redundancy analysis (BIRAs) performs limited analysis of faults during the fault collection process, resulting in a significant delay in generating a repair solution after the test sequence is completed. This inefficiency arises from the time required to repair the memory posttest. This article proposes a new fast and optimal BIRA using smart potential case collection. The proposed BIRA conducts a detailed analysis of detected faults during the test process. Using this novel fault collection results, a potential case is generated. This is a repair case that can repair the memory with a high probability and is generated immediately after the test sequence ends. If the memory cannot be repaired by the potential case, an exhaustive search is conducted for the faults requiring further analysis to generate an optimal repair solution. Compared to previous studies, the proposed BIRA demonstrates extremely low analysis time with an optimal repair rate.


  • TSV Built-In Self-Repair Architecture for Lifespan Reliability Enhancement of HBM

    by Donghyun Han, Duyeon Won, Sunghoon Kim, Sungho Kang

    High-bandwidth memory (HBM) is one of the 3-D stacked memory standards that demonstrate high performance, including high bandwidth, large capacity, and low power consumption. However, despite these advantages, issues related to reliability and yield have imposed limitations on mass production. Various methodologies to enhance the reliability of HBM have been proposed, such as built-in self-repair (BISR) architectures and error correction code algorithms. Nevertheless, ensuring the reliability of through-silicon vias (TSV) remains a challenging problem. Existing built-in architectures aiming to enhance TSV reliability often incur significant hardware overhead, limiting practical applications. In this article, an innovative TSV BISR architecture that can detect and repair permanent TSV faults in real time at the user stage is proposed. The proposed architecture significantly enhances the reliability of HBM while implementing it with minimal hardware overhead. Furthermore, it effectively identifies both temporary errors and permanent TSV faults, enabling efficient TSV repairs. Through fast and accurate TSV fault repair, the proposed architecture substantially improves the reliability of HBM.


  • TSV Built-In Self-Repair Architecture for Improving the Yield and Reliability of HBM

    by Youngkwang Lee, Donghyun Han, Sungho Kang

    High-bandwidth memory (HBM) is the latest 3-D-stacked dynamic random access memory (DRAM) standard adopted in Joint Electron Device Engineering Council (JEDEC). It has many advantages, such as high bandwidth, large capacity, and low power consumption, but mass production is challenging due to its low yield and reliability. One of the reasons is that through-silicon-vias (TSVs) are prone to defects. Therefore, HBM requires a TSV built-in self-repair (TBISR) architecture that can repair the TSV at a high repair rate even after chip shipment; however, implementing it through existing TSV repair architectures is difficult. They have a large area overhead or a low repair rate. In addition, they lack consideration for bidirectional TSV repair. To address these issues, this article proposes a novel TBISR architecture that can repair bidirectional TSVs and has a small area overhead and a high repair rate. Experimental results show that the proposed architecture, capable of bidirectional TSV repair, has a high repair rate, despite the small size compared to other architectures.


  • Novel Error-Tolerant Voltage-Divider-Based Through-Silicon-Via Test Architecture

    by Youngkwang Lee, Donghyun Han, Sooryeong Lee, Sungho Kang

    A voltage-divider-based through-silicon-via (TSV) test architecture tests the TSV by using the voltage value differently divided according to TSV defects. This architecture is widely used for TSV testing owing to its small hardware overhead and high test speed. However, the existing voltage-divider-based TSV test architectures are vulnerable to process–voltage–temperature (PVT) variations and noise. In addition, they cannot effectively detect pinhole defects. This study proposes a novel error-tolerant voltage-divider-based TSV test architecture to address these problems. The proposed architecture reduces the test errors by appropriately adjusting the on-resistance value of each MOSFET and adding a compensator circuit. In addition, it effectively detects the pinhole defects by modifying the voltage divider structure and changing the MOSFET control method. Experimental results reveal that the proposed architecture promptly tests various TSV defects and significantly reduces the test errors.


  • Open Access

    ECC-Aware Fast and Reliable Pattern Matching Redundancy Analysis for Highly Reliable Memory

    by Donghyun Han, Hayoung Lee, Seungtaek Lee, Sungho Kang

    Advanced capacity and density of memory have resulted in an increase in the probability of memory faults. The in-memory Error Correction Code (ECC), which solves this problem, is a widely used technology to improve the yield of highly integrated memory. However, the use of in-memory ECC causes problems that have not been considered in memory repair algorithms. Redundancy analysis is effective for repairing memory with redundant memory and in-memory ECC. In this paper, an ECC-aware fast and reliable pattern matching redundancy analysis algorithm for memory using both spare memory and in-memory ECC is proposed. This algorithm simplifies large-scale fault groups using in-memory ECC and includes an early termination method that can determine whether a memory that cannot be repaired with line spares can be repaired considering in-memory ECC. Experimental results show that the proposed pattern matching redundancy analysis algorithm achieves a similar yield but 14.6% less RA time and 8.6 times higher reliability compared to the existing redundancy analysis algorithms.

  • Multibank Optimized Redundancy Analysis Using Efficient Fault Collection

    by Hogyeong Kim, Hayoung Lee, Donghyun Han, Sungho Kang

    With technological advancements, the density and capacity of memory are rapidly increasing. As the number of memory cells increases, the difficulty of fault analysis and the number of faults also increase. Hence, the yield and test cost of memory have become essential issues in memory manufacturing. Many manufacturers have used redundancy analysis (RA) to improve the memory yield and decrease the test cost. However, most conventional RA methods require a lengthy analysis time to find a repair solution, and it is difficult to obtain an optimal repair rate with conventional RA algorithms. Although several algorithms using various spare structures to achieve performance improvement have been proposed, those improvements have not been ground breaking. In this article, a new multibank optimized RA (MORA) algorithm is proposed. It achieves a very high repair rate and a drastic reduction in the analysis time compared with conventional RA algorithms using various spare structures. During testing, the proposed algorithm stores the faulty cell information efficiently. Therefore, the analysis time can be shortened through the presolution process of the repair analysis using the proposed fault storage spaces. Additionally, the proposed spare structures are used to increase the repair rate. The experimental results reveal that the proposed algorithm can achieve a very high repair rate at a faster speed than conventional RA algorithms.


  • Open Access

    Effective Spare Line Allocation Built-in Redundancy Analysis With Base Common Spare for Yield Improvement of 3D Memory

    by Donghyun Han, Hayoung Lee, Sungho Kang

    The memory cell density and memory capacity have been increased for obtaining larger and faster memory. However, this threatens the memory reliability by increasing the probability of faulty cell generation. In this paper, a fast and small-area built-in redundancy analysis (RA) for the post-bond repair process in 3D memory is proposed. Spare line allocation is the structure for memory repair which the most widely used. However, the spare line structure that replaces the entire line which contains faults in each memory layer occurs inefficiency in repairing a small number of faults, including single faults, and it is difficult to share spares between layers. The proposed idea is to use spare line to repair line faults according to the characteristics of it, and to complement the structural limitations by proposing a new redundant spare. This is base common spare located on the base die, and it can be shared across all layers. The proposed BIRA improves the efficiency of spare lines with two complementary spare resource structures, achieving a short repair time and high repair rate. The proposed BIRA achieves 100% repair rate when there are at least 2 times more faults than the previous works with the same hardware overhead. In addition, it takes only at most 80% of the analysis time compared to the previous works, and as the number of faults increases, the analysis time reduction becomes greater compared to the previous works.