Testability properties of vertex precedent BDDs

This paper describes how technology mapping from VPBDDs is testability preserving. An algorithm for identifying unreachable arcs is presented. Theorems that prove the testability preservation during technology mapping are presented.

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

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

[3]  Ricardo Reis,et al.  Library Free Technology Mapping , 1997 .

[4]  Alexander Saldanha,et al.  Is redundancy necessary to reduce delay? , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Jochen Bern,et al.  Efficient OBDD-Based Boolean Manipulation in CAD Beyond Current Limits , 1995, 32nd Design Automation Conference.

[6]  Robert K. Brayton,et al.  Circuit structure relations to redundancy and delay , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Kurt Keutzer,et al.  Gate-delay-fault testability properties of multiplexor-based networks , 1991, 1991, Proceedings. International Test Conference.

[8]  Shin-ichi Minato,et al.  Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems , 1993, 30th ACM/IEEE Design Automation Conference.

[9]  Ricardo Reis,et al.  Associating CMOS transistors with BDD arcs for technology mapping , 1995 .