Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Woosik Jeong

dblp:91/8704 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 4 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware reliability and fault tolerance · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware reliability and fault tolerance › memory reliability
built-in redundancy analysis
0.112010
An Advanced BIRA for Memories With an Optimal Repair Rate and Fast Analysis Speed by Using a Branch Analyzer · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2010
Hardware reliability and fault tolerance
memory reliability
0.112010
An Advanced BIRA for Memories With an Optimal Repair Rate and Fast Analysis Speed by Using a Branch Analyzer · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2010
Hardware reliability and fault tolerance
memory repair
0.112010
An Advanced BIRA for Memories With an Optimal Repair Rate and Fast Analysis Speed by Using a Branch Analyzer · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2010
Hardware reliability and fault tolerance › redundancy
redundancy analysis
0.112010
An Advanced BIRA for Memories With an Optimal Repair Rate and Fast Analysis Speed by Using a Branch Analyzer · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2010

Methods — techniques the papers use, named apart from their topics

parallel node evaluation · 0.1must-repair analysis · 0.1branch analyzer · 0.1
YearPublicationVenuePosition
2020 Fail Memory Configuration Set for RA Estimation
abstract
Since the redundancy analysis (RA) has been introduced for memory yield, many RA researches have been conducted. However, objective comparisons of them are difficult by the absence of real memory models with realistic fault distributions. This paper presents a fail memory configuration set for RA estimation, called as ITC'2020 RA Benchmarks. It enables objective estimations of RAs with respect to effectiveness and efficiency. The fail memory configuration set includes memory models which have various redundancy structures and a fault generation algorithm with fault distribution which can be criteria for objective comparisons of RA. Simulations for estimations and comparisons of RA researches including BIRA are progressed utilizing the fail memory configuration set.
Hayoung Lee, Keewon Cho, Sungho Kang 0001, Wooheon Kang, Seungtaek Lee, Woosik Jeong
ITC6
2020 Novel Eye Diagram Estimation Technique to Assess Signal Integrity in High-Speed Memory Test
abstract
This paper presents a method for the evaluation of the eye diagram of a signal by analyzing the atypical Shmoo plot extracted from an automatic test equipment using a loopback technique. The loopback technique was used to minimize the external noise generated by an oscilloscope, thereby making it easier to measure the signals and collect raw data. In addition, the Shmoo plot extracted using a shorting package enables analyses of the signals entering the device in actual situations. Subsequently, an analysis tool was developed to investigate characteristics of the extracted atypical Shmoo plot, such as jitter, rise and fall time, and signal data rate. Furthermore, this tool indicates the signal loss rate for all the pass zones and center point deviations in the eye diagram. The analysis tool produces an eye diagram from the extracted Shmoo plot to determine the signal quality status and also statistically analyzes the extracted raw data to determine the process capability of the automatic test equipment.
Youngsu Oh, Dongmin Han, Byeongseon Go, Seungtaek Lee, Woosik Jeong
ITC5
2010 An Advanced BIRA for Memories With an Optimal Repair Rate and Fast Analysis Speed by Using a Branch Analyzer
abstract
As memory capacity and density grow, a corresponding increase in the number of defects decreases the yield and quality of embedded memories for systems-on-chip as well as commodity memories. For embedded memories, built-in redundancy analysis (BIRA) is widely used to solve quality and yield issues by replacing faulty cells with healthy redundant cells. Many BIRA approaches require extra hardware overhead in order to achieve optimal repair rates, or they suffer a loss of repair rate in minimizing the hardware overhead. An innovative BIRA approach is proposed to achieve optimal repair rates, lower area overhead, and increase analysis speed. The proposed BIRA minimizes area overhead by eliminating some storage coverage for only must-repair faulty information. The proposed BIRA analyzes redundancies quickly and efficiently by evaluating all nodes of a branch in parallel with a new analyzer which is simple and easy-to-implement. Experimental results show that the proposed BIRA allows for a much faster analysis speed than that of the state-of-the-art BIRA, as well as the optimal repair rate, and relatively small area overhead.
Woosik Jeong, Joohwan Lee, Taewoo Han 0001, Kaangchil Lee, Sungho Kang 0001
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
2009 A Fast Built-in Redundancy Analysis for Memories With Optimal Repair Rate Using a Line-Based Search Tree
abstract
With the growth of memory capacity and density, test cost and yield improvement are becoming more important. In the case of embedded memories for systems-on-a-chip (SOC), built-in redundancy analysis (BIRA) is widely used as a solution to solve quality and yield issues by replacing faulty cells with extra good cells. However, previous BIRA approaches focused mainly on embedded memories rather than commodity memories. Many BIRA approaches require extra hardware overhead to achieve the optimal repair rate, which means that 100% of solution detection is guaranteed for intrinsically repairable dies, or they suffer a loss of repair rate to minimize the hardware overhead. In order to achieve both low area overhead and optimal repair rate, a novel BIRA approach is proposed and it builds a line-based searching tree. The proposed BIRA minimizes the storage capacity requirements to store faulty address information by dropping all unnecessary faulty addresses for inherently repairable die. The proposed BIRA analyzes redundancies quickly and efficiently with optimal repair rate by using a selected fail count comparison algorithm. Experimental results show that the proposed BIRA achieves optimal repair rate, fast analysis speed, and nearly optimal repair solutions with a relatively small area overhead.
Woosik Jeong, Ilkwon Kang, Kyowon Jin
IEEE Trans. Very Large Scale Integr. Syst.1