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]  S. Chakradhar,et al.  Combinational ATPG theorems for identifying untestable faults in sequential circuits , 1993, Proceedings ETC 93 Third European Test Conference.

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

[3]  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).

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

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

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

[7]  D. E. Long,et al.  Identifying sequential redundancies without search , 1996, 33rd Design Automation Conference Proceedings, 1996.

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