Random pattern testability of memory control logic

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


This paper analyzes the random pattern testability of faults in the control logic of an embedded memory. We show how to compute exposure probabilities of these faults using mostly signal probability computations. We also show that the hardest memory control logic fault to detect is not necessarily the one with the lowest detection probability at the memory boundary.

Original languageEnglish (US)
Pages (from-to)305-312
Number of pages8
JournalIEEE Transactions on Computers
Issue number3
StatePublished - 1998

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics


  • Detection probability
  • Markov chain
  • Memory BIST
  • Memory postlogic
  • Memory prelogic
  • Signal probability


Dive into the research topics of 'Random pattern testability of memory control logic'. Together they form a unique fingerprint.

Cite this