Retiming-Based Partial Scan

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]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[2]  Janak H. Patel,et al.  A fault oriented partial scan design approach , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[3]  Arno Kunzmann,et al.  An analytical approach to the partial scan problem , 1990, J. Electron. Test..

[4]  Melvin A. Breuer,et al.  The BALLAST Methodology for Structured Partial Scan Design , 1990, IEEE Trans. Computers.

[5]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[6]  James Benjamin Saxe,et al.  Decomposable searching problems and circuit optimization by retiming: two studies in general transformations of computational structures , 1985 .

[7]  Janak H. Patel,et al.  HITEC: a test generation package for sequential circuits , 1991, Proceedings of the European Conference on Design Automation..

[8]  Vishwani D. Agrawal,et al.  Clock partitioning for testability , 1993, [1993] Proceedings Third Great Lakes Symposium on VLSI-Design Automation of High Performance VLSI Systems.

[9]  John P. Fishburn.  A depth-decreasing heuristic for combinational logic: or how to convert a ripple-carry adder into a carry-lookahead adder or anything in-between , 1991, DAC '90.

[10]  K.-T. Cheng,et al.  A Partial Scan Method for Sequential Circuits with Feedback , 1990, IEEE Trans. Computers.

[11]  Janak H. Patel,et al.  An optimization based approach to the partial scan design problem , 1990, Proceedings. International Test Conference 1990.

[12]  S.M. Reddy,et al.  On determining scan flip-flops in partial-scan designs , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[13]  Hanoch Levy,et al.  A Contraction Algorithm for Finding Small Cycle Cutsets , 1988, J. Algorithms.

[14]  Dinesh Bhatia,et al.  Pseudoexhaustive BIST for sequential circuits , 1993, Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93.

[15]  Janak H. Patel,et al.  PROOFS: a super fast fault simulator for sequential circuits , 1990, Proceedings of the European Design Automation Conference, 1990., EDAC..

[16]  Hans-Joachim Wunderlich,et al.  The pseudoexhaustive test of sequential circuits , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Melvin A. Breuer,et al.  Digital systems testing and testable design , 1990 .

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Sujit Dey,et al.  Resynthesis and retiming for optimum partial scan , 1994, DAC '94.

[20]  Kwang-Ting Cheng,et al.  Timing-driven partial scan , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.