The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1977 vol.26)
pp: 1141-1144
J., Jr. Knaizuk , Department of Computer Science, State University College
ABSTRACT
This correspondence presents an optimal algorithm to detect any single "stuck-at-i," "stuck-at-O" fault and any combination of "stuck-at-I," "stuck-at-O" multiple faults in a random access memory using only the n-bit memory address register input and m-bit memory buffer register input and output lines. It is shown that this algorithm requires 4 X 2n memory accesses.
INDEX TERMS
Fault detection stuck-at aults, optimal algorithm, random access memories.
CITATION
J., Jr. Knaizuk, C.R.P. Hartmann, "An Optimal Algorithm for Testing Stuck-at Faults in Random Access Memories", IEEE Transactions on Computers, vol.26, no. 11, pp. 1141-1144, November 1977, doi:10.1109/TC.1977.1674761
460 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool