Abstract
March C+ is commonly used as a memory test algorithm. The basic principle is to use finite state machines to read and write all the addresses one by one. This paper analysis the sensitivity conditions of several fault types not covered by the March C+ algorithm, and derived a new 22 N algorithm, March Y, which increase the fault coverage of WDF, CFdsxwx and CFwd. March Y has the same symmetry as the March C+ algorithm, and achieves the coverage of all of the single unit fault types and coupling faults.
Y. Wang—This work is supported in part by National Natural Science Foundation of China under grants 61170045.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Arden, W.M.: The international technology roadmap for semiconductors—perspectives and challenges for the next 15 years. Curr. Opin. Solid State Mater. Sci. 6, 371–377 (2002)
Adams, R., Cooley, E.: Analysis of a deceptive destructive read memory fault model and recommended testing. In: Proceedings of IEEE North Atlantic Test Workshop, pp. 27–32 (1996)
Dekker, R., Beenker, F., Thijssen, L.: A realistic fault model and test algorithms for static random access memories. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst. 9, 567–572 (1990)
Marinissen, E.J., Prince, B., Keltel-Schulz, D., Zorian, Y.: Challenges in embedded memory design and test. In: Proceedings of Design, Automation and Test in Europe, pp. 722–727. IEEE (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Y., Zheng, Q., Yuan, Y. (2016). The Improvement of March C+ Algorithm for Embedded Memory Test. In: Xu, W., Xiao, L., Li, J., Zhang, C. (eds) Computer Engineering and Technology. NCCET 2015. Communications in Computer and Information Science, vol 592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49283-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-49283-3_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-49282-6
Online ISBN: 978-3-662-49283-3
eBook Packages: Computer ScienceComputer Science (R0)
