|
ABSTRACT
Path delay fault testing becomes increasingly important due tohigher clock rates and higher process variability caused by shrinkinggeometries. Achieving high-coverage path delay fault testingrequires the application of scan justified test vector pairs, coupledwith careful ordering of the scan flip-flops and/or insertion ofdummy flip-flops in the scan chain. Previous works on scan synthesisfor path delay fault testing using scan shifting have focusedexclusively on maximizing fault coverage and/or minimizing thenumber of dummy flip-flops, but have disregarded the scan wirelengthoverhead. In this paper we consider both dummy flip-flopand wirelength costs, and focus on post-layout formulations thatcapture the achievable tradeoffs between these costs and delay faultcoverage in scan chain synthesis.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
Ravindra K. Ahuja , Thomas L. Magnanti , James B. Orlin, Network flows: theory, algorithms, and applications, Prentice-Hall, Inc., Upper Saddle River, NJ, 1993
|
| |
3
|
S. Barbagallo , M. Lobetti Bodoni , D. Medina , F. Corno , P. Prinetto , M. Sonza Reorda, Scan insertion criteria for low design impact, Proceedings of the 14th IEEE VLSI Test Symposium (VTS '96), p.26, April 28-May 01, 1996
|
| |
4
|
[4] Z. Barzalai and B.K. Rosen. Comparison of AC self-testing procedures. In Proc. Intl. Test Conference, pages 89-94, 1983.
|
| |
5
|
[5] K.D. Boese, A.B. Kahng, and R.S. Tsay. Scan chain optimization: Heuristic and optimal solutions. Internal Report, UCLA CS Dept., October 1994. Downloadable from http://www.gigascale.org/bookshelf/Slots/ScanOpt/.
|
| |
6
|
|
| |
7
|
[7] K.-T. Cheng, S. Devadas, and K. Keutzer. Delay-fault test generation and synthesis for testability under a standard scan design methodology. IEEE Transactions on Computer-Aided Design, 12:1217-1231, 1993.
|
| |
8
|
[8] M. Feuer and C. C. Koo. Method for rechaining shift register latches which contain more than one physical book. IBM Technical Disclosure Bulletin, 25(9):4818-4820, 1983.
|
| |
9
|
|
| |
10
|
|
| |
11
|
[11] P. Gupta, J. Abraham, and R.A. Parekhji. Improving path delay coverage in embedded cores - methodology and experiments. In Texas Instruments Symp. on Test, 2001.
|
 |
12
|
|
| |
13
|
[13] K. Helsgaun. An effective implementation of the lin-kernighan traveling salesman heuristic. European Journal of Operations Research, 12:106-130. Code available at http://www.dat.ruc.dk/~keld/research/LKH/., 2000.
|
| |
14
|
[14] D.S. Johnson and L.A. McGeoch. Experimental analysis of heuristics for the stsp. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations, pages 369-443, Dordrecht, 2002. Kluwer Academic Publishers.
|
| |
15
|
[15] S. Kobayashi, M. Edahiro, and M. Kubo. A vlsi scan-chain optimization algorithm for multiple scan-paths. IEICE Trans. Fundamentals, E82-A(11):2499- 2504, 1999.
|
| |
16
|
|
| |
17
|
[17] K.-H. Lin, C.-S. Chen, and T.T. Hwang. Layout driven chaining of scan flip-flops. IEE Proc., Computers and Digital Techniques, 143(6):421-425, 1996.
|
| |
18
|
|
| |
19
|
[19] Y.K. Malaiya and R. Narayanaswamy. Testing for timing faults in synchronous sequential integrated circuits. In Proc. Intl. Test Conference, pages 560-571, 1983.
|
| |
20
|
[20] W. Mao and M.D. Ciletti. Arrangement of latches in scan-path design to improve delay fault coverage. In Proc. Int. Test Conference, pages 387-393, 1990.
|
| |
21
|
[21] R.B. Norwood and E.J. McCluskey. Delay testing for sequential circuits with scan. Technical Report CRC TR 97-5, Center for Reliable Computing, Stanford University, 1976, available at http://www-crc.stanford.edu/crc_papers/CRC-TR- 97-5.pdf.
|
| |
22
|
[22] S.M. Reddy, C.J. Lin, and S. Patil. An automatic test pattern generation for the detection of path delay faults. In Proceedings IEEE-ACM International Conference on Computer-Aided Design, pages 284-287, 1987.
|
| |
23
|
|
|