1. Kulyamin, V.V. Kombinatorika slov i postroenie testovykh posledovatel'nostei / V.V. Kulyamin // Trudy ISP RAN. 2004. № 8(1). - S. 2540.
2. Goor, A.J. Testing Semiconductor Memories, Theory and Practice / A.J. Goor. - UK, Chi¬chester: John Wiley & Sons, 1991. - 487 s.
3. Chakraborty, K. Fault-Tolerance and Reliability Techniques for High-Density Random-Access Memory / K. Chakraborty, P. Mazumder. - Prentice Hall, 2002. - 424 p.
4. Hartman, A. Problems and Algorithms for Covering Arrays / A. Hartman, L. Raskin // Discrete Mathematics. - 2004. № 284. - P. 149156.
5. Cockburn, B. Tutorial on Semiconductor Memory Testing / B. Cockburn // JETTA. 1994. Vol. 5, № 4 P. 321336.
6. Hayes, J.P. Testing memories for single cell pattern sensitive fault / J.P. Hayes // IEEE Trans. on Computers. - 1980. Vol. 29, № 2. - P. 249-254.
7. Franklin, M. Testing reconfigured RAM’s and scrambled address RAM’s for pattern sensitive faults / M. Franklin, K.K. Saluja // IEEE Trans. on Computer-Aided Design of Integrated Circuits. - 1996. - Vol. 15, № 9. - P. 1081-1087.
8. Nicolaidis, M. Theory of transparent BIST for RAMs / M. Nicolaidis // IEEE Trans. on Computers. - 1996. - Vol. 45, № 10. - P. 1141-1156.
9. Karpovsky, M.G. Pseudo-Exhaustive Word-Oriented DRAM Testing / M.G. Karpovsky, V.N. Yarmolik, A.J. Goor // Proc. EUROTEST Conference. Munchen, Germany, 1995.
10. P. 126132.
11. Yarmolik, S.V. Memory Address Generation for Multiple Run March Tests with Different Average Hamming Distance / S.V. Yarmolik, V.N. Yarmolik // Proc. of IEEE East-West Design & Test Workshop (EWDTW’06). Sochi, Russia, 2006. P. 212216.
12. Yarmolik, S.V. Optimal Memory Address Seeds for Pattern Sensitive Faults Detection / S.V. Yarmolik, B. Sokol // Proc. of IEEE Workshop on Design i Diagnostics of Electronic Circuits and Systems (DDECS’2006). Prague, Czech Republic, 2006. P. 220221.
13. Yarmolik, S.V. Multi background memory testing / S.V. Yarmolik, I. Mrozek // Proc. of the 14th International Conference Mixed design of integrated circuits and systems (MIXDES’07). Ciechocinek, Poland, 2007. P. 511-516.
14. Tubbs, J.D. Note on binary template matching / J.D. Tubbs // Pattern Recognition. - 1989. Vol. 22, № 4. P. 359356.
15. Zhang, B. Binary vector dissimilarities for handwriting identification / B. Zhang, S.N. Srihari // Proc. SPIE, Document Recognition i retrieval X. Santa Clara, California, USA, 2003. -
16. P. 155166.
17. Mak-Vil'yams, F.D. Teoriya kodov, ispravlyayushchikh oshibki / F.Dzh. Mak-Vil'yams, N.Dzh. Sloen; per. s angl. M.: Svyaz', 1979. 744 s.
18. Yarmolik, V.N. Mnogokratnye nerazrushayushchie testy s izmenyaemymi adresnymi posledovatel'nostyami / V.N. Yarmolik, S.V. Yarmolik // Avtomatika i telemekhanika. - 2007. № 4. S. 126-137.
19. Linear Time Euclidean Distance Transform Algorithms / H. Breu [et al.] // IEEE Trans. on Pattern Analysis and Machine Intelligence. - 1995. Vol. 1, № 5. P. 529533.
20. Thompson, A.C. Minkowski Geometry / A.C. Thompson. Cambridge, N.-Y., 1996. - 364 p.
Email this article 