This paper will introduce the concept of the Transparency cube in the extraction and testing of an embedded logic submodule. The algorithm presented can establish control of a submodule in a very small amount of CPU time, and it was found to perform extremely well when tested on cellular array topologies such as those which occur in systolic architectures. The program described detects if parts of a circuit are untestable and notifies the user as to where additional logic is necessary to make the circuit more transparent or testable. It also introduces controllability numbers for flexible signals (or subscripted D's) and a method by which an Exclusive Or gate (EXOR) is handled as a single gate in the controllability calculations. This is useful since controllability numbers do not represent well the difficulties encountered with reconvergent fanout.
[1]
J. F. McDonald,et al.
Measured Performance of a Programmed Implementation of the Subscripted D-Algorithm
,
1983,
20th Design Automation Conference Proceedings.
[2]
H. T. Kung.
Let's Design Algorithms for VLSI Systems
,
1979
.
[3]
J. F. McDonald,et al.
Test Set Reduction Using the Subscripted D-Algorithm
,
1983,
ITC.
[4]
L. H. Goldstein,et al.
Controllability/observability analysis of digital circuits
,
1978
.
[5]
J. Paul Roth,et al.
Programmed Algorithms to Compute Tests to Detect and Distinguish Between Failures in Logic Circuits
,
1967,
IEEE Trans. Electron. Comput..