The problem of determining a minimal number of control inputs for converting a programmable logic array (PLA) with undetectable faults to crosspoint-irredundant PLA for testing has been formulated as a nonstandard set covering problem. By representing subsets of sets as cubes, this problem has been reformulated as familiar problems. It is noted that this result has significance because a crosspoint-irredundant PLA can be converted to a completely testable PLA in a straightforward fashion, thus achieving very good fault coverage and easy testability
145 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.This research has mainly cent...
Recent developments suggest both plausible fabrication techniques and viable architectures for build...
[[abstract]]A defect-tolerant PLA (programmable logic array) design with a simple column folding tec...
The problem of determining a minimal number of control inputs for converting a programmable logic ar...
In this paper, the validity of'single fault assumption in deriving diagnostic test sets is examined...
AbstractIn this paper we propose a new technique for designing easily testable PLAs. Our design is a...
An improved method which generates tests for multiple crosspoint faults in PLAs has been realized th...
[[abstract]]A new design to reduce the overhead required for a fully testable PLA is proposed. This ...
[[abstract]]Presents a complete fault-tolerant programmable logic array (PLA) design that includes b...
A method for PLA test pattern generation based on a branch and bound algorithm that exploits functio...
An on-line algorithm is developed for the location of single cross point faults in a PLA (FPLA). The...
A method for designing easily testable PLA's with low overhead is presented. The method is based on ...
[[abstract]]We propose a maximum crosstalk minimization algorithm taking logic synthesis into consid...
Abstract: We present a method for obtaining a minimal set of test configurations and their associate...
Recent developments suggest both plausible fabrication techniques and viable architectures for build...
145 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.This research has mainly cent...
Recent developments suggest both plausible fabrication techniques and viable architectures for build...
[[abstract]]A defect-tolerant PLA (programmable logic array) design with a simple column folding tec...
The problem of determining a minimal number of control inputs for converting a programmable logic ar...
In this paper, the validity of'single fault assumption in deriving diagnostic test sets is examined...
AbstractIn this paper we propose a new technique for designing easily testable PLAs. Our design is a...
An improved method which generates tests for multiple crosspoint faults in PLAs has been realized th...
[[abstract]]A new design to reduce the overhead required for a fully testable PLA is proposed. This ...
[[abstract]]Presents a complete fault-tolerant programmable logic array (PLA) design that includes b...
A method for PLA test pattern generation based on a branch and bound algorithm that exploits functio...
An on-line algorithm is developed for the location of single cross point faults in a PLA (FPLA). The...
A method for designing easily testable PLA's with low overhead is presented. The method is based on ...
[[abstract]]We propose a maximum crosstalk minimization algorithm taking logic synthesis into consid...
Abstract: We present a method for obtaining a minimal set of test configurations and their associate...
Recent developments suggest both plausible fabrication techniques and viable architectures for build...
145 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.This research has mainly cent...
Recent developments suggest both plausible fabrication techniques and viable architectures for build...
[[abstract]]A defect-tolerant PLA (programmable logic array) design with a simple column folding tec...