Sequential redundancy identification using recursive learning

A sequential redundancy identification procedure is presented. Based on uncontrollability analysis and recursive learning techniques, this procedure identifies c-cycle redundancies in large circuits, without simplifying assumptions or state transition information. The proposed procedure can identify redundant faults which require conflicting assignments on multiple lines. In this sense, it is a generalization of FIRES, a state-of-the-art redundancy identification algorithm. A modification of the proposed procedure is also presented for identifying untestable faults. Experimental results on ISCAS benchmarks demonstrate that these two procedures can efficiently identify a large portion of c-cycle redundant and untestable faults.

[1]  Mahesh Anantharaman Iyer.  On redundancy and untestability in sequential circuits , 1996 .

[2]  Kwang-Ting Cheng.  On removing redundancy in sequential circuits , 1991, 28th ACM/IEEE Design Automation Conference.

[3]  Yves Bertrand,et al.  MOSAIC: a multiple-strategy oriented sequential ATPG for integrated circuits , 1997, Proceedings European Design and Test Conference. ED & TC 97.

[4]  Dhiraj K. Pradhan,et al.  Functional learning: a new approach to learning in digital circuits , 1994, Proceedings of IEEE VLSI Test Symposium.

[5]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[6]  Vishwani D. Agrawal,et al.  Combinational ATPG theorems for identifying untestable faults in sequential circuits , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Miron Abramovici,et al.  Sequentially untestable faults identified without search ("simple implications beat exhaustive search!") , 1994, Proceedings., International Test Conference.

[8]  Miron Abramovici,et al.  Low-cost redundancy identification for combinational circuits , 1994, Proceedings of 7th International Conference on VLSI Design.

[9]  David E. Long,et al.  Identifying sequentially untestable faults using illegal states , 1995, Proceedings 13th IEEE VLSI Test Symposium.

[10]  Miron Abramovici,et al.  One-pass redundancy identification and removal , 1992, Proceedings International Test Conference 1992.

[11]  Rabindra K. Roy,et al.  The Best Flip-Flops to Scan , 1991, 1991, Proceedings. International Test Conference.

[12]  Wolfgang Kunz,et al.  HANNIBAL: An efficient tool for logic verification based on recursive learning , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[13]  Fabio Somenzi,et al.  Redundancy identification/removal and test generation for sequential circuits using implicit state enumeration , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  David E. Long,et al.  Identifying sequential redundancies without search , 1996, DAC '96.

[15]  On identifying undetectable and redundant faults in synchronous sequential circuits , 1994, Proceedings of IEEE VLSI Test Symposium.