Structural and behavioral synthesis for testability techniques

In this paper, a behavioral synthesis for testability system is presented. In this system, a testability modifier is connected to an existing behavioral level synthesis program, which accepts a circuit's behavioral description in C or VHDL as input. The outline of the system is as follows: (1) a testability analyzer is first applied to identify the hard-to-test areas in the circuit from the behavioral description; (2) a selection process is then applied to select test points or partial scan flip-flops. Selection is based on behavioral information rather than low-level structural description. This allows test point insertion or partial scan usage on circuits described as an interconnection of high level modules; (3) test statement insertion (TSI), an alternative to test point insertion and partial scan, is used to modify the circuit based on the selected test points. The major advantage of using TSI is a low pin count and test application time as compared to test point insertion and partial scan. In addition, TSI can be applied at the early design phase. This approach was implemented in a computer program, and applied to several sample circuits generated by a synthesis tool. The results are also presented. >

[1]  Balakrishnan Krishnamurthy.  A Dynamic Programming Approach to the Test Point Insertion Problem , 1987, 24th ACM/IEEE Design Automation Conference.

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

[3]  Jack Edward Stephenson,et al.  A testability measure for register-transfer level digital circuits , 1974 .

[4]  Prabhakar Goel,et al.  An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits , 1981, IEEE Transactions on Computers.

[5]  Daniel G. Saab,et al.  A novel behavioral testability measure , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  L. H. Goldstein,et al.  SCOAP: Sandia Controllability/Observability Analysis Program , 1988, 17th Design Automation Conference.

[7]  藤原 秀雄,et al.  Logic testing and design for testability , 1985 .

[8]  Vishwani D. Agrawal,et al.  A Complete Solution to The Partial Scan Problem , 1987 .

[9]  Parker,et al.  Design for Testability—A Survey , 1982, IEEE Transactions on Computers.

[10]  Daniel G. Saab,et al.  Beta: behavioral testability analysis , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[11]  John P. Hayes.  On Modifying Logic Networks to Improve Their Diagnosability , 1974, IEEE Transactions on Computers.

[12]  Alberto L. Sangiovanni-Vincentelli,et al.  An incomplete scan design approach to test generation for sequential machines , 1988, International Test Conference 1988 Proceeding@m_New Frontiers in Testing.

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

[14]  Sudhakar M. Reddy,et al.  On Minimally Testable Logic Networks , 1974, IEEE Transactions on Computers.

[15]  Irith Pomeranz,et al.  Polynomial Complexity Algorithms for Increasing the Testability of Digital Circuits by Testing Module Insertion , 1991, IEEE Trans. Computers.

[16]  Michael H. Schulz,et al.  SOCRATES: a highly efficient automatic test pattern generation system , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Premachandran R. Menon,et al.  An approach to functional level testability analysis , 1989, Proceedings. 'Meeting the Tests of Time'., International Test Conference.

[18]  James B. Angell,et al.  Enhancing Testability of Large-Scale Integrated Circuits via Test Points and Additional Logic , 1973, IEEE Transactions on Computers.

[19]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[20]  Vishwani D. Agrawal,et al.  An economical scan design for sequential logic test generation , 1989, [1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.