Referenced Items are not available for this document.
In this paper, the testing scheduling problem based on circuit partitioning is formulated into index coloring of the parallel testing graph (PTG). It is known that the index coloring problem is exponential in time cost, but the testing scheduling problem is proved to be polynomially solvable in theory. According to this result, an optimal testing scheduling algorithm is offered in quadratic time. Finally, a control scheme during testing scheduling is presented, which minimizes the number of the extra control inputs of the multiplexors to 2.1n ICN, here ICN is the index chromatic number of the PTG
Published in:
Test Symposium, 1993., Proceedings of the Second Asian
Date of Conference: 16-18 Nov 1993
- Page(s):
- 262 - 267
- Meeting Date :
- 16 Nov 1993-18 Nov 1993
- Print ISBN:
- 0-8186-3930-X
- INSPEC Accession Number:
- 4991847
- Conference Location :
- Beijing
- Digital Object Identifier :
- 10.1109/ATS.1993.398815
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
