A fast redundancy analysis algorithm in ATE for repairing faulty memories

Hyungjun Cho, Wooheon Kang, Sungho Kang

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Testing memory and repairing faults have become increasingly important for improving yield. Redundancy analysis (RA) algorithms have been developed to repair memory faults. However, many RA algorithms have low analysis speeds and occupy memory space within automatic test equipment. A fast RA algorithm using simple calculations is proposed in this letter to minimize both the test and repair time. This analysis uses the grouped addresses in the faulty bitmap. Since the fault groups are independent of each other, the time needed to find solutions can be greatly reduced using these fault groups. Also, the proposed algorithm does not need to store searching trees, thereby minimizing the required memory space. Our experiments show that the proposed RA algorithm is very efficient in terms of speed and memory requirements.

Original languageEnglish
Pages (from-to)478-481
Number of pages4
JournalETRI Journal
Volume34
Issue number3
DOIs
Publication statusPublished - 2012 Jun 1

Fingerprint

Redundancy
Data storage equipment
Repair
Testing
Experiments

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Computer Science(all)
  • Electronic, Optical and Magnetic Materials

Cite this

Cho, Hyungjun ; Kang, Wooheon ; Kang, Sungho. / A fast redundancy analysis algorithm in ATE for repairing faulty memories. In: ETRI Journal. 2012 ; Vol. 34, No. 3. pp. 478-481.
@article{d4cf2cbb1ed742e59142246f873a1d4a,
title = "A fast redundancy analysis algorithm in ATE for repairing faulty memories",
abstract = "Testing memory and repairing faults have become increasingly important for improving yield. Redundancy analysis (RA) algorithms have been developed to repair memory faults. However, many RA algorithms have low analysis speeds and occupy memory space within automatic test equipment. A fast RA algorithm using simple calculations is proposed in this letter to minimize both the test and repair time. This analysis uses the grouped addresses in the faulty bitmap. Since the fault groups are independent of each other, the time needed to find solutions can be greatly reduced using these fault groups. Also, the proposed algorithm does not need to store searching trees, thereby minimizing the required memory space. Our experiments show that the proposed RA algorithm is very efficient in terms of speed and memory requirements.",
author = "Hyungjun Cho and Wooheon Kang and Sungho Kang",
year = "2012",
month = "6",
day = "1",
doi = "10.4218/etrij.12.0211.0378",
language = "English",
volume = "34",
pages = "478--481",
journal = "ETRI Journal",
issn = "1225-6463",
publisher = "ETRI",
number = "3",

}

A fast redundancy analysis algorithm in ATE for repairing faulty memories. / Cho, Hyungjun; Kang, Wooheon; Kang, Sungho.

In: ETRI Journal, Vol. 34, No. 3, 01.06.2012, p. 478-481.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A fast redundancy analysis algorithm in ATE for repairing faulty memories

AU - Cho, Hyungjun

AU - Kang, Wooheon

AU - Kang, Sungho

PY - 2012/6/1

Y1 - 2012/6/1

N2 - Testing memory and repairing faults have become increasingly important for improving yield. Redundancy analysis (RA) algorithms have been developed to repair memory faults. However, many RA algorithms have low analysis speeds and occupy memory space within automatic test equipment. A fast RA algorithm using simple calculations is proposed in this letter to minimize both the test and repair time. This analysis uses the grouped addresses in the faulty bitmap. Since the fault groups are independent of each other, the time needed to find solutions can be greatly reduced using these fault groups. Also, the proposed algorithm does not need to store searching trees, thereby minimizing the required memory space. Our experiments show that the proposed RA algorithm is very efficient in terms of speed and memory requirements.

AB - Testing memory and repairing faults have become increasingly important for improving yield. Redundancy analysis (RA) algorithms have been developed to repair memory faults. However, many RA algorithms have low analysis speeds and occupy memory space within automatic test equipment. A fast RA algorithm using simple calculations is proposed in this letter to minimize both the test and repair time. This analysis uses the grouped addresses in the faulty bitmap. Since the fault groups are independent of each other, the time needed to find solutions can be greatly reduced using these fault groups. Also, the proposed algorithm does not need to store searching trees, thereby minimizing the required memory space. Our experiments show that the proposed RA algorithm is very efficient in terms of speed and memory requirements.

UR - http://www.scopus.com/inward/record.url?scp=84863331743&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84863331743&partnerID=8YFLogxK

U2 - 10.4218/etrij.12.0211.0378

DO - 10.4218/etrij.12.0211.0378

M3 - Article

VL - 34

SP - 478

EP - 481

JO - ETRI Journal

JF - ETRI Journal

SN - 1225-6463

IS - 3

ER -