IEEE Transactions on Very Large Scale Integration (VLSI) Systems · 1995 · 28 citations · 23 references
EngineeringComputer EngineeringComputer ScienceAlgorithmsComputer ArchitectureFault-tolerant ComputingBuilt-in Self-testDesign For TestabilityField-programmable Gate Array ArchitectureAnalog Built-in Self-testField-programmable Gate Array TestabilityLogic Built-in Self-testMicroprocessor Built-in Self-testWord Length Effects
A design-for-testability (DFT) approach for VLSI iterative logic arrays (ILA's) is proposed, which results in a small constant number of test patterns. Our technique applies to arrays with an arbitrary dimension, and to arrays with various connection types, e.g., hexagonal or octagonal ones. Bilateral ILA's are also discussed. The DFT technique makes general ILA's C-testable by using a truth-table augmentation approach. We propose an output-assignment algorithm for minimizing the hardware overhead. We give a CMOS systolic array multiplier as an example, and show that an overhead of no more than 5.88% is sufficient to make it C-testable, i.e., 100% single cell-fault testable with only 18 test patterns regardless of the word length of the multiplier. Our technique guarantees that the test set is easy to generate. Its corresponding built-in-self-test structures are also very simple.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
23
Easily Testable Iterative Systems
Arthur Friedman · IEEE Transactions on Computers · 1973 · 253 citations
Testing for faults in combinational cellular logic arrays
William H. Kautz · 1967 · 175 citations