RT-level transformations for gate-level testability

The authors introduce a technique to transform a given RT-level design into a functionality equivalent, minimized design which is 100% testable under full-scan at the gate level. The proposed optimization technique uses the RT-level structure and exploits the interaction between the control and the data path. The approach maintains the design hierarchy while performing RT-level transformations of initially specified data path, followed by resynthesis of control using do not cares extracted from the data path. Experiments with RTL benchmarks demonstrate the effectiveness of the technique in generating fully testable designs, while consistently reducing area and delay.<<ETX>>

[1]  Janusz Rajski,et al.  The testability-preserving concurrent decomposition and factorization of Boolean expressions , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Robert K. Brayton,et al.  Observability relations and observability don't cares , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[3]  Prithviraj Banerjee,et al.  Logic Partitioning and Resynthesis for Testability , 1991, 1991, Proceedings. International Test Conference.

[4]  A. Mujumdar,et al.  Incorporating testability considerations in high-level synthesis , 1992, [1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing.

[5]  Srinivas Devadas,et al.  Exact algorithms for output encoding, state assignment, and four-level Boolean minimization , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Robert K. Brayton,et al.  MIS: A Multiple-Level Logic Optimization System , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  LaNae J. Avra,et al.  ALLOCATION AND ASSIGNMENT IN HIGH-LEVEL SYNTHESIS FOR SELF-TESTABLE DATA PATHS , 1991, 1991, Proceedings. International Test Conference.

[8]  David Bryan,et al.  Automated synthesis for testability , 1989 .

[9]  Robert K. Brayton,et al.  Circuit structure relations to redundancy and delay: the KMS algorithm revisited , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[10]  Norbert Wehn,et al.  A New Approach to Multiplexer Minimisation in the CALLAS Synthesis Environment , 1991, VLSI.

[11]  Christos A. Papachristou,et al.  A built-in self-testing approach for minimizing hardware overhead , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[12]  F. Brglez,et al.  Circuit partitioning for logic synthesis , 1991 .

[13]  Kurt Keutzer,et al.  A unified approach to the synthesis of fully testable sequential machines , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Reinaldo A. Bergamaschi,et al.  Synthesis using path-based scheduling: algorithms and exercises , 1991, DAC '90.

[15]  Peter Duzy,et al.  The Synthesis Approach to Digital System Design , 1992 .

[16]  Reinaldo A. Bergamaschi,et al.  The effects of false paths in high-level synthesis , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[17]  Niraj K. Jha,et al.  Behavioral synthesis for easy testability in data path allocation , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.