Skip to main content
Have a personal or library account? Click to login
Address Sequences and Backgrounds with Different Hamming Distances for Multiple Run March Tests Cover

Address Sequences and Backgrounds with Different Hamming Distances for Multiple Run March Tests

Open Access
|Oct 2008

References

  1. Bernardi E., Sancez M., Squillero G. and Sonza Reorda M. (2006). An effective technique for minimizing the cost of processor software-based diagnosis in SoCs,, Munich, Germany, pp. 412-417.
  2. Bernardi P., Grosso M., Rebaudengo M. and Sonza Reorda M. (2005). Exploiting an infrastructure IP to reduce the costs of memory diagnosis in SoCs,, Tallinn, Estonia, pp. 202-207.
  3. Cheng K.-L., Tsai M.-F. and Wu C.-W. (2001). Efficient neighborhood pattern-sensitive fault test algorithms for semiconductor memories,, Marina del Rey, CA, USA, pp. 225-237.
  4. Cheng K.-L., Tsai M.-F. and Wu C.-W. (2002). Neighborhood pattern sensitive fault testing and diagnostics for random access memories,(11): 1328-1336.
  5. Cockburn B. E. (1995). Deterministic tests for detecting scrambled pattern-sensitive faults in RAMs,, San Jose, CA, USA, pp. 117-122.
  6. Franklin M. and Saluja K. K. (1996). Testing reconfigured RAM's and scrambled address RAM's for pattern sensitive faults,(9): 1081-1087.
  7. Gilbert E. N. (1958). Gray codes and paths on the-cube,: 815-826.
  8. Goor A. J. v. d. (1991)., John Wiley & Sons, Chichester.
  9. Gray F. (1958). Pulse code communication,
  10. Hayes J. P. (1975). Detection of pattern sensitive faults in random access memories,(2): 150-157.
  11. Hayes J. P. (1980). Testing memories for single cell pattern sensitive fault,(2): 249-254.
  12. Li J.-F. (2007). Transparent-test methodologies for random access memories without/with ECC,(10): 1888-1983.
  13. Niggemeyer D., Redeker M. and Otterstedt J. (1998). Integration of non-classical faults in standard march tests,, San Jose, CA, USA, pp. 91-96.
  14. Niggemeyer D., Redeker M. and Rudnick E. (2000). Diagnostic testing of embedded memories based on output tracing,, San Jose, CA, USA, pp. 113-118.
  15. Pomeranz I. and Reddy S. M. (2006). Fault detection by output response comparison of identical circuits using half-frequency compatible sequences,, Santa Clara, CA, USA, pp. 202-207.
  16. Savage C. (1997). A survey of combinatorial Gray codes,(4): 605-629.
  17. Sokol B. and Yarmolik S. V. (2006). Address sequence for March tests to detect pattern sensitive faults,, Kuala Lumpur, Malaysia, pp. 354-357.
  18. Suk D. S. and Reddy S. M. (1980). Test procedures for a class of pattern sensitive faults in semiconductor random access memories,(6): 419-429.
  19. Yarmolik S. V. (2006). Gray code with maximum of Hamming distance,, Dnipropetrovsk, Ukraine, p. 77.
  20. Yarmolik S. V. and Sokol B. (2006). Optimal memory address seeds for pattern sensitive faults detection,, Prague, Czech Republic, pp. 220-221.
  21. Yarmolik S. V. and Yarmolik V. N. (2006a). Memory pattern sensitive faults detection using multiple runs of March tests,(9): 104-113.
  22. Yarmolik V. N., Klimets Y. and Demidenko S. (1998). March PS(23n) test for DRAM pattem sensitive faults,, Singapore, pp. 354-351.
  23. Yarmolik V. N. and Yarmolik S. V. (2006b). Address sequences for multiple run march tests,: 59-68.
DOI: https://doi.org/10.2478/v10006-008-0030-y | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Language: English
Page range: 329 - 339
Published on: Oct 6, 2008
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2008 Svetlana Yarmolik, published by University of Zielona Góra
This work is licensed under the Creative Commons License.