Algorithmic Complexity of Pseudo-Ring Testing for Stuck-at Faults

Abstract

This paper describes calculation of algorithmic complexity of pseudo-ring testing obtained by simulation of stuck-at faults and realization of pseudo-ring testing of 4-bit and 8-bit memory. The method is designed for both bit- and wordoriented memory and it is invariant to the width of data bus of the memory.