This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Retiming-Based Partial Scan
January 1996 (vol. 45 no. 1)
pp. 74-87

Abstract—A generally effective criterion for the selection of flip-flops in the partial scan problem for sequential circuit testability is to select flip-flops that break the cyclic structure of the circuit and reduce its sequential depth. The selection of flip-flops may also be subject to a prescribed bound on the clock period of the modified circuit (timing-driven partial scan). In this paper we propose two techniques (for non-timing-driven and timing-driven partial scan) which address the above criterion based on a transformation of sequential circuits known as retiming. For non-timing-driven partial scan, we employ retiming to rearrange the flip-flops of the circuit, so that its functionality is preserved, while the number of flip-flops that are needed to break all cycles and bound the sequential depth is significantly reduced. For timing-driven partial scan, we propose a retiming-based technique that reduces the overall area overhead required to achieve the clock period bound. Experimental results on the ISCAS'89 circuits show the benefit of our approach in both timing-driven and non-timing-driven partial scan.

[1] M. Abramovici,M.A. Breuer, and A.D. Friedman,Digital Systems Testing and Testable Design.New York: Computer Science Press, 1990.
[2] S. Chakradhar and S. Dey,"Retiming and resynthesis for optimum partial scan," Proc. 31st ACM/IEEE Design Automation Conf., 1994.
[3] K.T. Cheng and V.D. Agrawal, Partial Scan Method for Sequential Circuits with Feedback IEEE Trans. Computers, vol. 39, pp. 544-548, 1990.
[4] W.-T. Cheng and J.H. Patel,"PROOFS: A super fast simulator for sequential circuits," Proc. IEEE Int'l Conf. Computer-Aided Design, pp. 475-479, 1990.
[5] V. Chickermane and J.H. Patel, An Optimization Based Approach to the Partial Scan Design Problem Proc. IEEE Int'l Test Conf., pp. 377-386, 1990.
[6] V. Chickermane and J.H. Patel, "A Fault Oriented Partial Scan Design Approach," Proc. Int'l. Conf. Computer-Aided Design (ICCAD 91), IEEE CS Press, Los Alamitos, Calif., 1991, pp. 400-403.
[7] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGraw-Hill, 1990.
[8] K.L. Einspahr,S.C. Seth, and V.D. Agrawal,"Clock partitioning for testability," Proc. IEEE Great Lakes Symp. VLSI, pp. 42-46, 1993.
[9] J.P. Fishburn,"A depth-decreasing heuristic for combinational logic," Proc. 27th ACM/IEEE Design Automation Conf., pp. 361-364, 1990.
[10] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[11] R. Gupta, R. Gupta, and M.A. Breuer, The BALLAST Methodology for Structured Partial Scan Design IEEE Trans. Computers, vol. 39, pp. 538-544, 1990.
[12] J.Y. Jou and K.T. Cheng, Timing-Driven Partial Scan Proc. IEEE Int'l Conf. Computer-Aided Design, pp. 404-407, 1991.
[13] D. Kagaris,S. Tragoudas, and D. Bhatia,"Pseudo-exhaustive BIST for sequential circuits," Proc. IEEE Int'l Conf. Computer Design, pp. 523-527, 1993.
[14] A. Kunzmann and H. Wunderlich, "An Analytical Approach to the Partial Scan Problem," J. Electronic Testing, 1990, pp. 163-174.
[15] D.H. Lee and S.M. Reddy, On Determining Scan Flip-Flops in Partial Scan Designs Proc. IEEE/ACM Int'l Conf. Computer-Aided Design, pp. 322-325, 1990.
[16] C.E. Leiserson and J.B. Saxe,"Retiming synchronous circuitry," Algorithmica, vol. 6, pp. 5-35, 1991.
[17] H. Levy and D.W. Low,"A contraction algorithm for finding small cycle cutsets," J. Algorithms, vol. 9, pp. 470-493, 1988.
[18] T. Niermann and J. Patel, HITEC: A Test Generation Package for Sequential Circuits Proc. European Conf. Design Automation, pp. 214-218, 1991.
[19] C.H. Papadimitriu and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, 1987.
[20] J.B. Saxe,"Decomposable searching problems and circuit optimization by retiming: Two studies in general transformations of computational structures," PhD dissertation, Dept. Computer Science, Carnegie-Mellon Univ., Aug. 1985.
[21] Texas Instruments Eng. Staff, The TTL Data Book for Design Engineers, 2nd ed. Dallas Tex.: Texas Instruments Inc., 1976.
[22] H.-J. Wunderlich and S. Hellebrand, "The Pseudo-Exhaustive Test of Sequential Circuits," IEEE Trans. Computer-Aided Design, vol. 11, no. 1, pp. 26-33, 1992.

Index Terms:
Design for testability, minimum feedback vertex set, partial scan, retiming, sequential depth, timing-driven partial scan.
Citation:
Dimitrios Kagaris, Spyros Tragoudas, "Retiming-Based Partial Scan," IEEE Transactions on Computers, vol. 45, no. 1, pp. 74-87, Jan. 1996, doi:10.1109/12.481488
Usage of this product signifies your acceptance of the Terms of Use.