Abstract
The problem of detecting single cellular faults in arbitrarily large (one-dimensional, unilateral, combinational) iterative logic arrays (= ILAs) is considered. We prove that the test complexity of such an ILA is either constant or linear in the length of the ILA. The determination of the test complexity and the specification of the test set can be carried out by algorithms whose complexity only depends on the individual cell function of the ILA. Fault patterns which characterize any cellular fault are denned and their testability properties like (full, partial) testability, redundancy, test complexity are studied to give insight into the testability properties of the ILA under test construction.
The research reported has been supported in part by DFG, Grant 1176/3-1.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. S. Abadir and H. K. Reghbati. Functional testing of semiconductor random access memories. Computing Surveys, 15:175–198, 1983.
B. Becker and J. Hartmann. Optimal-time multipliers and c-testability. In Symp. on Parallel Algorithms and Architectures (SPAA'90), pages 174–179, 1990.
B. Becker and U. Sparmann. Computations over finite monoids and their test complexity. In 19th Int. Symp. on Fault-Tolerant Computing, pages 299–306, 1989.
B. Becker and U. Sparmann. A uniform test approach for RCC-Adders. In Proc. of the 3rd Aegean Workshop on Parallel Computation and VLSI Theory, Lecture Notes in Comp. Sci. 319, pages 288–300, 1988.
M. Cappa and V.C. Hamacher. An augmented iterative array for high speed binary division. IEEE Trans. on Comp., C-22:172–176, 1973.
W.T. Cheng and J. H. Patel. Testing in two-dimensional iterative logic arrays. In Proc. of the 16th Int. Symp. on Fault Tolerant Computing Systems, pages 76–81, July 1986.
W. Daehn and J. Mucha. A hardware approach to self-testing of large PLA's. IEEE Trans. on Comp., C-30:829–833, 1981.
J. Ferguson and J.P. Chen. The design of two easily-testable VLSI array multipliers. In Proc. of the 6th Symp. on Computer Arithmetic, pages 2–9, June 1983.
A.D. Friedman. Easily testable iterative systems. IEEE Trans. on Comp., C-22:1061–1064, December 1973.
H. Fujiwara and K. Kinoshita. A design of programmable logic arrays with universal tests. IEEE Trans. on Comp., C-30(11):823–828, 1981.
F.C. Hennie. Iterative Arrays of Logical Circuits. M.I.T. Press, Cambridge, Mass., 1961.
W.H. Kautz. Testing for faults in combinational cellular logic arrays. In Proc. 5th Annual Symp. on Switching and Automata Theory, pages 161–1744, 1967.
T.W. Ku and M. Soma. Minimal overhead modification of iterative logic arrays for c-testability. In Proc. IEEE Int. Test Conf., pages 964–969, 1990.
B. Milne. Testability, 1985 technology forecast. Electronic Design, 10:143–166, 1985.
T. Sridhar and J.P. Hayes. Design of easily testable bit-sliced systems. In IEEE Trans. on Comp., pages 563–571, August 1981.
S.H. Unger. Pattern recognition using two dimensional, bilateral, iterative, combination, switching circuits. In Proc. Symp. Math. Theory of Automata, pages 577–591, April 1962.
A. Vergis and K. Steiglitz. Testability conditions for bilateral arrays of combinational cells. IEEE Trans. on Comp., C-35(1):13–22, January 1986.
C.D. Weiss. Optimal synthesis of arbitrary switching functions with regular arrays of two-input one-output switching elements. IEEE Trans. on Comp., C-18:839–856, September 1969.
T.W. Williams, W. Daehn, M. Grützner, and C.W. Starke. Comparison of aliasing errors for primitive and non-primitive polynomials. In Proc. IEEE Int. Test Conf., pages 282–288, 1986.
C.W. Wu and P.R. Capello. Easily testable iterative logic arrays. IEEE Trans. on Comp., C-39(5):640–652, May 1990.
H.J. Wunderlich. Hochintegrierte Schaltungen: Prüfgerechter Entwurf und Test. Springer Verlag, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Becker, B., Hartmann, J. (1992). Some remarks on the test complexity of iterative logic arrays. In: Havel, I.M., Koubek, V. (eds) Mathematical Foundations of Computer Science 1992. MFCS 1992. Lecture Notes in Computer Science, vol 629. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-55808-X_12
Download citation
DOI: https://doi.org/10.1007/3-540-55808-X_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55808-8
Online ISBN: 978-3-540-47291-9
eBook Packages: Springer Book Archive