Design, diagnosis and reconfiguration of defect-tolerant VLSI
Chang, Ming-Feng
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/19672
Description
Title
Design, diagnosis and reconfiguration of defect-tolerant VLSI
Author(s)
Chang, Ming-Feng
Issue Date
1991
Doctoral Committee Chair(s)
Fuchs, W. Kent
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Electronics and Electrical
Computer Science
Language
eng
Abstract
This thesis examines three specific issues of defect-tolerant VLSI: (1) design and reconfiguration of defect-tolerant linear arrays, (2) diagnosis and reconfiguration of memory chips with spare rows/columns, and (3) optimal diagnosis procedures for k-out-of-n structures.
In Chapter 2, design and reconfiguration approaches for high harvest rates and high performance of linear arrays are described. Our design is an extension of the loop-based approach developed by Horst. The defect-tolerant designs allow each cell to interconnect with up to eight neighbors, and maintain a constant wire length between any two logically adjacent cells independent of fault distribution. A reconfiguration strategy is developed to improve the harvest rate of loop-based approaches. The problem complexity of harvesting the maximum number of fault-free cells is analyzed and a heuristic reconfiguration algorithm is presented.
In Chapter 3, the problem of diagnosis and spare allocation for random access memory with coupling faults is investigated. Both diagnosis and repair of coupling faults by utilizing spare rows and columns are examined. We show that a coupling fault is repaired if its coupling cell is replaced by utilizing a spare row or its coupled cell is replaced by utilizing a spare row or column. By specifying both the coupled cell and coupling cell, the amount of redundancy required to repair a given set of faults may be reduced. A diagnosis procedure for RAM is provided to locate stuck-at faults as well as coupling faults, and a repair procedure has been implemented to allocate rows and columns for repair. A graph model is employed to describe the repair of coupling faults.
In Chapter 4, optimal diagnosis procedures of k-out-of-n structures are described. Knowledge of the probability of each unit being good and the expected test time of each unit are used by the diagnosis algorithm to select units for testing. The general problem of optimal diagnosis is described followed by an examination of diagnosis for k-out-of-n structures. The optimal diagnosis of k-out-of-n systems is presented along with a complete proof. A compact representation of the optimal diagnosis scheme which needs $O$($n\sp2$) space and can be generated in $O$($n\sp2$) time is also described.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
