ENSURING THE COMPLETE TESTABILITY OF PROGRAMMABLE LOGIC MATRICES

Authors
GOLDBERG EI NOVIKOV YA
Citation
Ei. Goldberg et Ya. Novikov, ENSURING THE COMPLETE TESTABILITY OF PROGRAMMABLE LOGIC MATRICES, Automation and remote control, 57(10), 1996, pp. 1522-1529
Citations number
15
Categorie Soggetti
Controlo Theory & Cybernetics","Computer Application, Chemistry & Engineering","Instument & Instrumentation","Robotics & Automatic Control
Journal title
Automation and remote control → ACNP
ISSN journal
00051179
Volume
57
Issue
10
Year of publication
1996
Part
2
Pages
1522 - 1529
Database
ISI
SICI code
0005-1179(1996)57:10<1522:ETCTOP>2.0.ZU;2-S
Abstract
The method of transformation of an arbitrary programmable logic matrix (PLM) into a PLM for which there exists an easily constructed complet e test for testing multiple faults is proposed. The transformation is performed by adding several additional inputs. The length of the compl ete test does not exceed the doubled number of single faults. An exper iment on a set of practical examples (MCNC Benchmark, 91) has shown th at the proposed method for the PLM with more than 20 inputs requires 3 .5% of the additional area in the mean.