Minimal March Test Algorithm for Detection of Linked Static Faults in Random Access Memories

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by G. Harutunyan Articles by V.A. Vardanian Articles by Y. Zorian Zorian

24th IEEE VLSI Test Symposium

Berkeley, California

April 30-May 04

ISBN: 0-7695-2514-8

	ASCII Text	x
	G. Harutunyan, V.A. Vardanian, Y. Zorian Zorian, "Minimal March Test Algorithm for Detection of Linked Static Faults in Random Access Memories," VLSI Test Symposium, IEEE, pp. 120-127, 24th IEEE VLSI Test Symposium, 2006.

	BibTex	x
	@article{ 10.1109/VTS.2006.46, author = {G. Harutunyan and V.A. Vardanian and Y. Zorian Zorian}, title = {Minimal March Test Algorithm for Detection of Linked Static Faults in Random Access Memories}, journal ={VLSI Test Symposium, IEEE}, volume = {0}, year = {2006}, isbn = {0-7695-2514-8}, pages = {120-127}, doi = {http://doi.ieeecomputersociety.org/10.1109/VTS.2006.46}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - VLSI Test Symposium, IEEE TI - Minimal March Test Algorithm for Detection of Linked Static Faults in Random Access Memories SN - 0-7695-2514-8 SP120 EP127 A1 - G. Harutunyan, A1 - V.A. Vardanian, A1 - Y. Zorian Zorian, PY - 2006 KW - null VL - 0 JA - VLSI Test Symposium, IEEE ER -

G. Harutunyan, Virage Logic, Armenia

V.A. Vardanian, Virage Logic, Armenia

Y. Zorian Zorian, Virage Logic, Armenia

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/VTS.2006.46

In this paper, a new notion of 2-composite static faults covering all unlinked and (realistic) linked static faults is introduced. We have introduced 120 new linked fault primitives missing in the paper by Hamdioui et al (IEEE TCAD 2004), thus extending the universe of linked fault primitives known before by 25%. A March test algorithm of length 23N (N - number of memory words) for detection of linked static faults in Random Access Memories is proposed. It reduces the length of a previously known algorithm (Hamdioui et al, IEEE TCAD 2004) by 18N. We proved the proposed test is of minimum length

Citation:

G. Harutunyan, V.A. Vardanian, Y. Zorian Zorian, "Minimal March Test Algorithm for Detection of Linked Static Faults in Random Access Memories," vts, pp.120-127, 24th IEEE VLSI Test Symposium, 2006

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.