Abstract
Test access mechanisms (TAMs) and test wrappers are integral parts of a system-on-chip (SOC) test architecture. Prior research has concentrated on only one aspect of the TAM/wrapper design problem at a time, i.e., either optimizing the TAMs for a set of pre-designed wrappers, or optimizing the wrapper for a given TAM width. In this chapter1, we address a more general problem of carrying out TAM design and wrapper optimization in conjunction. We present an efficient algorithm to construct wrappers that reduce the testing time for cores. Our wrapper design algorithm improves on earlier approaches by also reducing the TAM width required to achieve these lower testing times. We present new mathematical models for TAM optimization that use the core testing time values calculated by our wrapper design algorithm. We further present a new enumerative method for TAM optimization that reduces execution time significantly when the number of TAMs being designed is small. Experimental results are presented for an academic SOC as well as an industrial SOC.
This chapter is based in part on, V. Iyengar, K. Chakrabarty and E.J. Marinissen, “Test wrapper and test access mechanism co-optimization for system-on-a-chip,” Journal of Electronic Testing: Theory and Applications, vol. 18, no. 2, pp.211–228, March 2002. ©2001 Kluwer Academic Publishers. Reprinted by permission.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Chakrabarty, K., Iyengar, V., Chandra, A. (2002). Test Wrapper and TAM Co-Optimization. In: Test Resource Partitioning for System-on-a-Chip. Frontiers in Electronic Testing, vol 20. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1113-7_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1113-7_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5400-0
Online ISBN: 978-1-4615-1113-7
eBook Packages: Springer Book Archive