Efficient March Tests for a Reduced 3-Coupling and 4-Coupling Faults in Random-Access Memories

  • Authors:

  • Petru Caşcaval;Stuart Bennett;Corneliu Huţanu

  • Affiliations:

  • Department of Computer Science, “Gh. Asachi” Technical University of Iaşi, Bd. D. Mangeron, nr.53A, 6600, Iaşi, Romania. cascaval@cs.tuiasi.ro;Department of Automatic Control and Systems Engineering, The University of Sheffield, Mappin Street, Sheffield S13JD, UK. S.Bennett@sheffield.ac.uk;Department of Automatic Control, “Gh. Asachi” Technical University of Iaşi, Bd. D. Mangeron, nr.53A, 6600, Iaşi, Romania. chutanu@ac.tuiasi.ro

  • Venue:
  • Journal of Electronic Testing: Theory and Applications
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents two new march test algorithms, MT-R3CF and MT-R4CF, for detecting reduced 3-coupling and 4-coupling faults, respectively, in n × 1 random-access memories (RAMs). To reduce the length of the tests, only the coupling faults between physically adjacent memory cells have been considered. The tests assume that the storage cells are arranged in a rectangular grid and that the mapping from logical addresses to physical cell locations is known completely. The march tests need 30n and 41n operations, respectively. In this paper any memory fault is modelled by a set of primitive memory faults called simple faults. We prove, using an Eulerian graph model, the ability of the test algorithms to detect all simple coupling faults. This paper also includes a study regarding the ability of the test MT-R3CF to detect interacting linked 3-coupling faults. This work improves the results presented in [1] where a similar model of reduced 3-coupling faults has been considered and a march test with 38n operations has been proposed. To compare these new march tests with other published tests, simulation results are presented in this paper.