Abstract
We consider the problem of detecting singleV-coupling faults (as defined by Nair, Thatte, and Abraham) inn×1 random-access memories (RAMs). First we derive a lower bound of 2V−2 nlog2 n+(2V+3)n on the length of any test that detects all singleV-coupling faults, for 2≤V≤47 andn=2e whereeɛ{8,...,34}. In the derivation we make use of a family of binary codes which we call (n, θ)-exhaustive codes. We then describe a procedure which, given any (n, V−1)-exhaustive code, constructs a test that detects all singleV-coupling faults, forn≥V>2. Following this approach, optimal (n,1)- and (n, 2)-exhaustive codes are used to construct S2CTEST and S3CTEST, which are efficient tests of length 10n and 4nlog2 n+18n that detect all single 2- and 3-coupling faults, respectively. S3CTEST is roughly five times shorter, for current RAM capacities, than Papachristou and Sahgal's test of length 24n[log2 n]+n. Codes generated according to Tang and Chen are used similarly to construct S4CTEST and S5CTEST, which are tests of approximate length 8.6n(log2 n)1.585 and 9.6n(log2 n)2.322 that detect all single 4- and 5-coupling faults, respectively. S5CTEST has the interesting property of being able to detect all single physical neighborhood pattern-sensitive faults without requiring the mapping from logical cell addresses to physical cell locations. S5CTEST also detects the scrambled pattern-sensitive fault recently proposed by Franklin and Saluja; moreover, the new test is approximately fourteen times shorter (for 1 and 4 Mbit RAMs) than the test they describe.
Similar content being viewed by others
References
J. Cocking, “RAM Test Patterns and Test Strategy,”Dig. of Papers, 1975 Semicond. Test Symp., Cherry Hill, NJ, pp. 1–8, Oct. 14–16, 1975.
S.M. Thatte and J.A. Abraham, “Testing of Semiconductor Random Access Memories,”Dig. of Papers, 7th Intl. Conf. on Fault-Tolerant Computing, Los Angeles, CA, pp. 81–87, June 28–30, 1977.
R. Nair, S.M. Thatte, and J.A. Abraham, “Efficient algorithms for testing semiconductor random-access memories,”IEEE Trans. Comp., vol. C-27, pp. 572–576, June 1978.
R. David, A. Fuentes, and B. Courtois, “Random pattern testing versus deterministic testing of RAMs,”IEEE Trans. Comp., vol. C-38, pp. 637–650, May 1989.
C.A. Papachristou and N.B. Sahgal, “An improved method for detecting functional faults in semiconductor random access memories,”IEEE Trans. Comp., vol. C-34, pp. 110–116, Feb. 1985.
J. Savir, W.H. McAnney, and S.R. Vecchio, “Testing for Coupled Cells in Random-Access Memories,”Proc. 1989 Intl. Test Conf., Washington, DC, pp. 439–451, Aug. 29–31, 1989.
J.A. Brzozowski and B.F. Cockburn, “Detection of coupling faults in RAMs,”J. of Electronic Testing Theory and Applications, vol. 1, pp. 151–162, May 1990.
B.F. Cockburn,Fault Models and Tests for Coupling Faults in Random-Access Memories, Ph.D. thesis, Dept. of Computer Science Research Report CS-90-41, Univ. of Waterloo, Ont., Canada, Oct. 1990.
B.F. Cockburn and J.A. Brzozowski, “Near-optimal tests for classes of write-triggered coupling faults in RAMs,”J. of Electronic Testing: Theory and Applications, vol. 3, pp. 251–264, Aug. 1992.
M. Marinescu, “Efficient Functional Testing of RAMs,”Proc. 2nd Int. Conf. on Reliability and Maintainability, Perros-Guirec /Trégastel, France, pp. 31–37, Sept. 8–12, 1980.
B.F. Cockburn, “Deterministic Tests for Detecting Single V-Coupling Faults in RAMs,” Computer Engineering Technical Report CETR-92-200, July 24, 1992.
E. Marczewski, “Independance d'ensembles et prolongement de mesures (résultats et problèmes),”Colloq. Math., vol. 1, pp. 122–132, 1948.
A. Reyni,Foundations of Probability, John Wiley, New York, NY, 1971.
G.O.H. Katona, “Two applications of Sperner type theorems (for search theory and truth functions),”Period. Math. Hungar., vol. 3, pp. 19–26, 1973.
D.J. Kleitman and J. Spencer, “Families ofk-independent sets,”Discrete Math., vol. 6, pp. 255–262, 1973.
N. Alon, “Explicit construction of exponential sized families ofk-independent sets,”Discrete Math., vol. 58, pp. 191–193, 1986.
A.K. Chandra, L.T. Kou, G. Markowsky, and S. Zaks, “On sets of Booleann-vectors with allk-projections surjective,”Acta Informatica, vol. 20, pp. 103–111, 1983.
D.T. Tang and L.S. Woo, “Exhaustive test pattern generation with constant weight vectors,”IEEE Trans. Comp., vol. C-32, pp. 1145–1150, Dec. 1983.
D.T. Tang and C.L. Chen, “Iterative exhaustive pattern generation for logic testing,”IBM J. Res. Develop., vol. 28, pp. 212–219, Mar. 1984.
G. Seroussi and N.H. Bshouty, “Vector sets for exhaustive testing of logic circuits,”IEEE Trans. on Info. Theory, vol. 34, pp. 513–522, May 1988.
Z. Barzilai, D. Coppersmith, and A.L. Rosenberg, “Exhaustive generation of bit patterns with applications to VLSI self-testing,”IEEE Trans. Comp., vol. C-32, pp. 190–194, Feb. 1983.
E.J. McCluskey, “Verification testing—a pseudoexhaustive test technique,”IEEE Trans. Comp., vol. C-33, pp. 541–546, June 1984.
L.-T. Wang and E.J. McCluskey, “Condensed linear feedback shift register (LFSR) testing—a pseudoexhaustive test technique,”IEEE Trans. Comp., vol. C-35, pp. 367–370, Apr. 1986.
C.L. Chen, “Exhaustive test pattern generation using cyclic codes,”IEEE Trans. Comp., vol. C-37, pp. 225–228, Feb. 1988.
L.-T. Wang and E.J. McCluskey, “Circuits for pseudoexhaustive test patern generation,”IEEE Trans. on CAD., vol. CAD-7, pp. 1068–1080, Oct. 1988.
E.I. Mazur, “Algebraic method for generation of locally trivial tests,”Automation and Remote Control, vol. 50, pp. 1126–1129, Aug. 1989.
A.J. van de Goor and Y. Zorian, “Effective March Algorithms for Testing Single-Order Addressed Memories,”Proc. 1993 Eur. Conf. on Design Automation, Paris, France, pp. 499–505, Feb. 22–25, 1993.
J.P. Hayes, “Detection of pattern-sensitive faults in random-access memories,”IEEE Trans. Comp., vol. C-24, pp. 150–157, Feb. 1975.
J.P. Hayes, “Testing of memories for single-cell pattern-sensitive faults,”IEEE Trans. Comp., vol. C-29, pp. 249–254, Mar. 1980.
D.S. Suk and S.M. Reddy, “Test procedures for a class of pattern-sensitive faults in semiconductor random-access memories,IEEE Trans. Comp., vol. C-29, pp. 419–429, June 1980.
K.K. Saluja and K. Kinoshita, “Test pattern generation for API faults in RAM,”IEEE Trans. Comp., vol. C-34, pp. 284–287, Mar. 1985.
P. de Jong and A.J. van de Goor, “Comments on ‘test pattern generation for API faults in RAM’,”IEEE Trans. Comp., vol. C-37, pp. 1426–1428, Nov. 1988.
M. Franklin and K.K. Saluja, “An Algorithm to Test RAMs for Physical Neighborhood Pattern Sensitive Faults,”Proc. of the 1991 Int. Test Conf., Nashville, TN, pp. 675–684, Oct. 26–30, 1991.
A.J. van de Goor,Testing Semiconductor Memories: Theory and Practice, John Wiley & Sons, Chichester, U.K., 1991.
H.-D. Oberle, M. Maue, and P. Muhmenthaler, “Enhanced Fault Modeling for DRAM Test and Analysis,”Dig. of the 1991 IEEE VLSI Test Symp., Atlantic City, NJ, pp. 149–154, Apr. 15–17, 1991.
B.F. Cockburn, “A 20 MHz Test Vector Generator for Producing Tests that Detect Single 4- and 5-Coupling Faults in RAMs,”Records of the 1993 IEEE Int. Workshop on Memory Testing, San Jose, CA, Aug. 9–10, 1993.
Author information
Authors and Affiliations
Additional information
This work was supported by operating grants from the Central Research Fund of the University of Alberta and the Natural Sciences and Engineering Research Council of Canada under grant OGP0105567.
Rights and permissions
About this article
Cite this article
Cockburn, B.F. Deterministic tests for detecting singleV-coupling faults in RAMs. J Electron Test 5, 91–113 (1994). https://doi.org/10.1007/BF00971966
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00971966