Testing and Error Detection in Iterative Logic Arrays
Cheng, Wu-Tung
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/69545
Description
Title
Testing and Error Detection in Iterative Logic Arrays
Author(s)
Cheng, Wu-Tung
Issue Date
1985
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)
Computer Science
Abstract
The test methods of general iterative logic arrays (ILAs) composed of combinational cells are considered in the first part of this report. The fault model assumed is that faults in a cell can change a cell behavior in any arbitrary way, as long as the cell remains a combinational circuit. At the array level, two fault-models are considered: in the single cell fault-model (SCFM) we assume only one cell can be faulty; and in the multiple cell fault-model (MCFM) we assume any number of cells can be faulty. Previous papers have solved the testing problems of C-testable and linear testable unilateral one-dimensional (1-D) ILAs under SCFM. The necessary and sufficient condition of a test set in unilateral 1-D ILAs under MCFM is derived here. With this condition, two procedures that can generate near-minimum test sets for linear testable and C-testable unilateral 1-D ILAs respectively are proposed. Furthermore, the results are extended to generate test sets for bilateral 1-D ILAs, unilateral tree-structured ILAs and unilateral two-dimensional ILAs under SCFM and MCFM. Finally, improving all the testing methods to cover sequential faults are proposed.
In the second part of this paper, using the methods of Recomputing with Shifted Operands (RESO) to detect errors in ILAs are discussed. Here, our fault model covers all kinds of faults within a cell, including permanent, nonpermanent, combinational, sequential, static, dynamic and indeterminate-logic faults. Necessary and sufficient conditions on the basic cell flow table are derived to determine if a unilateral 1-D ILA is RESO-detectable. The problems of fault location are also considered. It is shown that an arbitrary cell flow table can be augmented by the addition of some outputs to make it RESO-detectable. The implementation of RESO with rotation instead of shift operation is also considered. The results are extended to bilateral 1-D ILAs and two-dimensional ILAs.
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.
