Abstract
In this article we discuss a test generation, design-for-testability and built-in self-test methodology for two-dimensional iterative logic arrays (ILAs) that perform arithmetic functions. Our approach is unique because a single graph labeling procedure is used to generate test vectors, implement design-for-testability as well as design the circuitry for built-in self-test. The graph labeling is based on mathematical properties of full-addition such as symmetry and self-duality. Circuit modifications are introduced by a systematic procedure based on the graph labeling, that enable them to be tested with a fixed number of tests irrespective of their size. The approach is novel as it also greatly simplifies the processes of on-chip test vector generation and response comparison that are necessary for built-in self-test. Each circuit module is tested in a pseudo-exhaustive manner with deterministic as opposed to random test sequences. This results in a comprehensive test of the circuit for which built-in self-test is designed.
Similar content being viewed by others
References
H. Elhuni, A. Vergis, and L. Kinney, “C-testability of two-dimensional iterative arrays,” IEEE Transactions on Computer-Aided Design, vol. CAD-5, pp. 573–481, October 1986.
W.H. Kautz, “Testing for faults in combinational cellular logic arrays,” 8th Annual Symposium on Switching and Automata. Theory, pp. 161–174, 1967.
E. Parthasarthy and S.M. Reddy, “A testable design of iterative logic arrays,” IEEE Transactions on Computers, vol. C-30, pp. 833–841, November 1981.
J.P. Shen and F.J. Ferguson, “The design of easily testable array multipliers,” IEEE Transactions on Computers, vol. C-33, pp. 554–560, June 1984.
H. Fujiwara, “Computational complexity of controllability/observability problems for combinational circuits,” IEEE Transactions on Computers, vol. 39, pp. 762–767, June 1990.
W.T. Cheng and J.H. Patel, “Testing in two-dimensional iterative logic arrays,” Proceedings, International Symposium on Fault Tolerant Computing, pp. 76–81, 1986.
W.T. Cheng, Testing and Error Detection in Iterative Logic Arrays, Ph.D. dissertation. University of Illinois, Urbana-Champaign 1985.
T.A. Davis, R.P. Kunda, and W.K. Fuchs, “Testing of bit-serial multipliers,” Proceedings, International Conference on Computer Design, Port Chester, NY, pp. 430–434, October 1985.
D. Bhattacharya and J.P. Hayes, “Fast and easily testable implementations of arithmetic functions,” 16th International Symposium on Fault Tolerant Computing, pp. 324–329, June 1986.
Edward J. McCluskey, “Built-in self-test techniques,” IEEE Design and Test, pp. 21–28, April 1985.[/or]
Edward J. McCluskey, “Built-in verification test,” IEEE International Test Conference, pp. 183–190, November 1982.
Edward J. McCluskey and S. Bozorgui-Nesbat, “Design for autonomous test,” IEEE Transactions on Computers, vol. C-30, pp. 866–875, November 1981.
R.M. Sedmak, “Design for self-verification: an approach for dealing with testability problems in VLSI-based designs,” IEEE International Test Conference, pp. 112–124, October 1979.
E.M. Aboulhamid and E. Cerny, “Built in testing of unilateral iterative arrays,” IEEE Transactions on Computers, vol. C-33, pp. 560–564, June 1984.
T. Sridhar and J.P. Hayes, “Design of easily testable bit-sliced systems,” IEEE Transactions on Computers, vol. C-30, pp. 842–854, November 1981.
Younggap You and John P. Hayes, “Implementation of VLSI self-testing by regularization,” IEEE Transaction on Computer-Aided Design, vol. 8, pp. 1261–1271, January 1989.
E.J. McCluskey, “Verification testing—a pseudo exhaustive approach,” IEEE Transactions on Computers, vol. C-33, pp. 541–546, June 1984.
S.B. Akers, “On the use of linear sums in exhaustive testing,” 15th International Symposium on Fault Tolerant Computer, pp. 148–153, June 1985.
A. Chatterjee and J.A. Abraham, “On the C-testability of generalized counters,” IEEE Transactions on Computer-Aided Design, vol. CAD-6, pp. 713–726, September 1987.
P.R. Menon and A.D. Friedman, “Fault detection in iterative logic arrays,” IEEE Transactions on Computers, vol. C-20, pp. 524–535, May 1971.
A.D. Friedman and P.R. Menon, Theory and Design of Switching Circuits, Computer Science Press, Rockville, MD, 1975.
F.C. Hennie, Finite State Models for Logical Machines, Prentice Hall, Englewood Cliffs, NJ, 1968.
F.J.O. Dias, “Truth table verification of an iterative logic array,” IEEE Transactions on Computers, vol. C-25, pp. 605–612, June 1976.
C.W. Wu and P.R. Capello, “Easily testable iterative logic arrays,” IEEE Transactions on Computers, vol. 39, pp. 640–652, May 1990.
W.T. Cheng and J.H. Patel, “A shortest length test sequence for sequential fault detection in ripple carry adders,” Proceedings, International Conference on Computer-Aided Design, pp. 71–73, 1985.
W.T. Cheng and J.H. Patel, “A minimum test set for multiple fault detection in ripply carry adders,” IEEE Transactions on Computers, vol. C-36, pp. 891–895, July 1987.
A. Chatterjee and J.A. Abraham, “NCUBE: An automatic test generation program for iterative logic arrays,” Proceedings, International Conference on Computer-Aided Design, Santa Clara, CA, pp. 428–431, November 1988.
K. Hwang, Computer Arithmetic, Principles, Architecture and Design, John Wiley, New York, 1979.
A. Chatterjee, “The testability of regular logic structures,” Ph.D. Dissertation, University of Illinois at Urbana-Champaign, 1990.
Author information
Authors and Affiliations
Additional information
This research was supported by the General Electric Company and by the Semiconductor Research Corporation under contracts SRC RSCH 88-DP-108 at the University of Illinois and SRC RSCH 89-DP-142 at the University of Texas at Austin.
Rights and permissions
About this article
Cite this article
Chatterjee, A., Abraham, J.A. Test generation, design-for-testability and built-in self-test for arithmetic units based on graph labeling. J Electron Test 2, 351–372 (1991). https://doi.org/10.1007/BF00135230
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00135230