Design of Crosspoint-Irredundant PLAs Using Minimal Number of Control Inputs

Authors:
K. S. Ramanatha;N. N. Biswas
Affiliations:
Univ. of Manitoba, Winnepeg, Manitoba, Canada;Indian Institute of Science, Bangalore, India
Venue:
IEEE Transactions on Computers
Year:
1988

Citing 3
Cited 1

Algorithm 457: finding all cliques of an undirected graph

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Logic and Switching Theory

Introduction to Logic and Switching Theory

An addition to the methods of test determination for fault detection in combinational circuits

Acta Cybernetica

Quantified Score

Hi-index	14.98

Visualization

Abstract

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.