A highly-efficient transparent online memory test

The transparent online memory test (TOMT) proposed in this paper has been specifically developed for online testing of word-oriented memories with parity or Hamming code protection. Using a rotated address sequence the algorithm passes four times through the whole address space and performs embedded march tests for every word. The careful interleaving of word-oriented and bit-oriented test allows one to attain a fault coverage and a test duration comparable to the widely used March C- algorithm. The proposed memory test detects all stuck-at faults, all transition faults, all address decoder faults (even stuck-open address decoder faults), all single coupling faults (CFs, even write and read disturb CFs) and a reasonable percentage of linked CFs. Nevertheless, the algorithm is suitable for online use and can be implemented in hardware with moderate effort