z-logo
open-access-imgOpen Access
An informational approach to quantizing the effectiveness of test data arrays for static memory devices
Author(s) -
Ju S. Akinina,
В. Е. Болнокин,
S.V. Tyurin,
Abraham Akinin,
С. П. Попов
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/862/5/052015
Subject(s) - static random access memory , row , computer science , column (typography) , test data , row and column spaces , algorithm , binary number , binary data , matrix (chemical analysis) , maximization , parallel computing , mathematics , mathematical optimization , computer hardware , arithmetic , telecommunications , materials science , frame (networking) , database , composite material , programming language
While testing of the Static Random Access Memory (SRAM) the effective detection of potential faults is mostly determined by the structure and the algorithm of test arrays of data generation. This article proposes a multiplicative indicator W , which allows us to quantify the quality of test arrays of data. It is necessary to represent test arrays of data as a binary matrix, where each column corresponds to a certain bit of SRAM, and the rows correspond to test patterns. In this case, the process of sequential formation of test patterns is identified with the percolation process on a rectangular grid. It is assumed that percolation occurs at the moment when the maximization of the binary antagonisms both on the rows and on the columns of the binary matrix is provided. In this case, the binary sequences in all columns of the matrix must be different. Preliminary experimental data allows to suggest that the evaluation of the quality of test arrays of data based on the proposed indicator W can simultaneously be considered as the maximum efficiency of detecting a certain class of potential SRAM faults in a certain order of reading test data.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here