PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
June 1, 1978IEEE Transactions on Computers201 citations

Efficient Algorithms for Testing Semiconductor Random-Access Memories

View Full Paper
NNairTThatteAAbraham

Key Points

Key points are not available for this paper at this time.

Abstract

A fault model which views faults in semiconductor random-access memories at a functional level instead of at a basic gate level is presented. An efficient 0(n) algorithm to detect all faults in the fault model is described. The fault model is then extended to incorporate more complex faults. An 0(n · log2 n) algorithm is presented for one such extended fault model.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Nair et al. (1978) studied this question.

synapsesocial.com/papers/6a20738acbc595e1903177ffhttps://doi.org/10.1109/tc.1978.1675150
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1An Optimal Algorithm for Testing Stuck-at Faults in Random Access Memories1977 · 63 citations
  2. 2Techniques for testing the microcomputer family1976 · 26 citations
  3. 3Diagnosis and Reliable Design of Digital Systems1976 · 528 citations
  4. 4Fault Diagnosis of Semiconductor Random Access Memories.1977 · 7 citations
  5. 5Selecting Test Patterns for 4K RAMS1977 · 10 citations