This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Test-Pattern Generation Based on Reed-Muller Coefficients
August 1993 (vol. 42 no. 8)
pp. 968-980

Reed-Muller coefficients are used to generate a test-pattern selection procedure for detecting single stuck-at faults. This procedure is based on the heuristics deduced from the way in which the spectral coefficients are affected by such faults. The changes that the spectral coefficients undergo are also compared with the fault models used most frequently to model defects in combinational circuits. The proposed pattern-generating procedure does not need a simulation of the circuit for each of the possible stuck-at faults, and its complexity is proportional to the number of gates in the circuit. The proportionality constant increases exponentially as the number of inputs in the circuit increases. To evaluate the performance of the proposed method, its application to some benchmark circuits, including the ALU 74181, is presented.

[1] D. M. Miller and J. C. Muzio, "Spectral fault signatures for internally unate combinational networks,"IEEE Trans. Comput., C-33, 1984.
[2] D. M. Miller and J. C. Muzio, "Spectral fault signatures for single stuck-at faults in combinational networks,"IEEE Trans. Comput., vol. C-33, no. 8, pp. 765-769, 1984.
[3] D. M. Miller and J. C. Muzio, "Spectral techniques for fault detection in combinational logic," inSpectral Techniques and Fault Detection, M. G. Karpovsky, ed., 1985, pp. 371-420.
[4] A. K. Susskind, "Testing by verifying Walsh coefficients,"IEEE Trans. Comput., vol. C-2, no. 2, pp. 198-201, Feb. 1983.
[5] T.-C. Hsiao and S. C. Seth, "Analysis of the use of Rademacher-Walsh spectrum in compact testing,"IEEE Trans. Comput., vol. C-33, pp. 934-937, Oct. 1984.
[6] S. L. Hurst, D. M. Miller, and J. C. Muzio,Spectral Techniques in Digital Logic. New York: Academic, 1985.
[7] C. R. Edwards, "The application of the Rademacher-Walsh transform to Boolean function classification and threshold logic synthesis,"IEEE Trans. Comput., vol. C-24, pp. 48-62, Jan. 1975.
[8] E. Eris and J. C. Muzio, "Spectral testing of circuit realisations based on linearisations,"IEE Proc., vol. 133, pt. E, no. 2, pp. 73-78, Mar. 1986.
[9] T. Damarla and M. G. Karpovsky, "Detection of stuck-at and bridging faults in Reed-Muller canonical (RMC) networks,"IEE Proc., vol. 136, pt. E, no. 5, Sept. 1989.
[10] T. R. Damarla and M. Karpovski, "Fault detection in combinational networks by Reed-Muller transforms,"IEEE Trans. Comput., vol. C-38, no. 6, pp. 788-797, June 1989.
[11] S. M. Reddy, "Easily testable realizations for logic functions,"IEEE Trans. Comput., vol. C-21, pp. 1183-1188, Nov. 1972.
[12] K. K. Saluja and S. M. Reddy, "Fault detecting test sets for Reed-Muller canonic networks,"IEEE Trans. Comput., vol. C-33, pp. 995-998, 1984.
[13] J. Ortega, "Test de circuitos digitales mediante técnicas espectrales basadas en una nueva transformada," Ph.D. dissertation, University of Granada, Spain, 1990.
[14] C. Moraga and K. Seseke, "The Chrestenson tranform in pattern analysis," inSpectral Techniques and Fault Detection, M. G. Karpovsky, ed. 1985, pp. 143-178.
[15] J. Ortega, A. Lloris, A. Prieto, and F. J. Pelayo, "Using Reed-Muller coefficients to synthesize optimal prediction modules for concurrent testing,"Electronics Letters, vol. 27, no. 14, pp. 1243-1245, July 1991.
[16] J. Ortega, A. Prieto, A. Lloris, and F. J. Pelayo, "Optimization problems on concurrent testing solved by neural networks," inArtificial Neural Networks, Lecture Notes in Computer Science. Springer-Verlag, 1991, pp. 385-394.
[17] E. J. McCluskey, "Built-in self-test techniques,"IEEE Design&Test, pp. 21-36, Apr. 1985.
[18] E. J. McCluskey, "Built-in self-test structures,"IEEE Design&Test, pp. 29-36, 1985.
[19] J. Ortega, A. Prieto, A. Lloris, and F. J. Pelayo, "Universal built-in self-test procedure for CMOS PLA's,IEEE Trans. Circuits and Systems, vol. CAS-38, no. 8, pp. 941-945, Aug. 1991.
[20] V. D. Agrawal and S. C. Seth, "Test generation for VLSI chips,"IEEE Computer Society Tutorial, no. 786, 1988.
[21] J. A. Abraham and W. K. Fuchs, "Fault and error models for VLSI,"Proc. IEEE, vol. 74, no. 5, pp. 639-654, May 1986.
[22] S. A. Al-Arian and D. P. Agrawal, "Physical failures and fault models of CMOS circuits,"IEEE Trans. Circuits and Syst., vol. CAS-34, pp. 269-279, Mar. 1987.
[23] N. Burgess, R. I. Damper, K. A. Totton, and S. J. Shaw, "Physical faults in MOS circuits and their coverage by different fault models,"IEE Proc., vol. 135, pt. E, no. 1, pp. 1-9, Jan. 1988.
[24] K. C. Y. Mei, "Bridging and stuck-at faults,"IEEE Trans. Comput., vol. TC-23, no. 7, pp. 720-727, July 1974.
[25] J. G. Kuhl and S. M. Reddy, "On the detection of stuck-at faults,"IEEE Trans. Comput., vol. C-27, pp. 467-469, May 1978.
[26] M. G. Karpovsky and L. B. Levitin, "Universal testing of computer hard-ware," inSpectral Techniques and Fault Detection, M. G. Karpovsky, ed. Orlando, FL: Academic, 1985.
[27] P. Goel, "Test generation costs analysis and projections," inProc. 17th Design Automat. Conf., 1980, pp. 77-84.
[28] S. L. Hurst,The Logical Processing of Digital Signals. New York: Crane-Russak, and London: Edward Arnold, 1978.
[29] D. H. Green, "Families of Reed-Muller canonical forms,"Int. J. Electronics, vol. 70, no. 2, pp. 259-280, 1991.
[30] A. Lloris, J. Ortega, and A. Prieto, "The fast Tamari transform,IEE Proc.-E., vol. 138, no. 3, pp. 147-153, May 1991.
[31] T. Damarla and M. Karpovsky, "Reed-Muller transforms for fault detections," inProc. 2nd Int. Workshop Spectral Techniques, Ecole Polytechnique de Montreal, Montreal, Oct. 1986.
[32] J. L. A. Hughes and E. J. McCluskey, "Multiple stuck-at fault coverage of single stuck-at fault test sets,"Proc. Int. Test Conf., Washington, DC, Sept. 1987, pp. 368-374.
[33] J. L. A. Hughes, "Multiple fault detection using single fault test sets,"IEEE Trans. Computer-Aided Design, vol. 7, no. 1, pp. 100-108, Jan. 1988.
[34] N. K. Jha, "Detecting multiple faults in CMOS circuits," inProc. Int. Test Conf., Washington, DC, Sept. 1986, pp. 514-519.
[35] C. K. Chin and E. J. McCluskey, "Test length for pseudorandom testing,"IEEE Trans. Comput., vol. C-36, pp. 252-256, Feb. 1986.
[36] Y. K. Malaiya and S. Yang, "The coverage problem for random testing," inIEEE Int. Test Conf., 1984, pp. 237-245.
[37] K. D. Wagner, C. K. Chin, and E. J. McCluskey, "Pseudorandom/testing."IEEE Trans. Comput., vol. C-36, pp. 332-343, Mar. 1987.
[38] O. H. Ibarra and S. K. Sahni, "Polynomially Complete Fault Detection Problems,"IEEE Trans. Comput., vol. C-24, no. 3, pp. 242-249, Mar. 1975.
[39] J. Savir, G. S. Ditlow, and P. H. Bardell, "Random pattern testability,"IEEE Trans. Comput., vol. C-33, no. 1, pp. 79-90, Jan. 1984.
[40] ASIC Philips Personal Design Station User Manual. International Microelectronics Support Centre, Philips International, B.V., 1988.
[41] Z. Barzilai, J. Savir, G. Markovski, and M. G. Smith, "The weighted syndrome sums approach to VLSI testing,"IEEE Trans. Comput., vol. C-30, pp. 996-1000, Dec. 1981.
[42] F. Brglez, "On testability analysis of combinational networks," inProc. Int. Symp. Circ. Syst., May 1984, pp. 221-225.
[43] S. C. Seth, L. Pan, and V. D. Agrawal, "PREDICT--Probabilistic estimation of digital circuit testability,"Fault-Tolerant Comp. Symp. Digest, June 1985, pp. 220-225.
[44] M. Serra and J. C. Muzio, "Testability by sum of syndromes," inProc. Tehn. Workshop New Directions for IC Testing, Victoria, B.C., Canada, Mar. 1986, pp. 11.1-11.20.

Index Terms:
test pattern generation; Reed-Muller coefficients; test-pattern selection procedure; single stuck-at faults; heuristics; spectral coefficients; combinational circuits; pattern-generating procedure; complexity; benchmark circuits; ALU 74181; computational complexity; logic testing.
Citation:
J. Ortega, A.L. Ruiz, A. Prieto, F.J. Pelayo, "Test-Pattern Generation Based on Reed-Muller Coefficients," IEEE Transactions on Computers, vol. 42, no. 8, pp. 968-980, Aug. 1993, doi:10.1109/12.238487
Usage of this product signifies your acceptance of the Terms of Use.