A Highly-Efficient Transparent Online Memory Test

  • Authors:
  • Karl Thaller

  • Affiliations:
  • -

  • Venue:
  • ITC '01 Proceedings of the 2001 IEEE International Test Conference
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Transparent Online Memory Test (TOMT)proposed in this paper has been specifically developed for online testing of word-oriented memorieswith parity or Hamming code protection. Using arotated address sequence the algorithm passes fourtimes through the whole address space and performsembedded march tests for every word. The careful interleaving of word-oriented and bit-oriented test allows to attain a fault coverage and a test durationcomparable to the widely used March C- algorithm.The proposed memory test detects all stuck-at faults,all transition faults, all address decoder faults (evenstuck-open address decoder faults), all single couplingfaults (CFs, even write and read disturb CFs) and areasonable percentage of linked CFs. Nevertheless,the algorithm is suitable for online use and can beimplemented in hardware with moderate effort.