Derivation of high quality tests for large heterogeneous circuits: floating-point operations

The problem of deriving high quality tests for fast combinational floating-point realizations is investigated. Floating-point circuits are heterogeneous, consisting of a large number of regular and irregular modules. Thus, the test strategy applied combines specialized structure based methods and universal test generation. In order to guarantee sufficient controllability and observability of embedded modules, small hardware modifications are proposed. As a result, the authors obtain optimal-time floating-point circuits for arbitrary operand lengths which can be tested completely with respect to a strong fault model by a minimal number of test patterns.<<ETX>>

[1]  Bernd Becker,et al.  Computations over finite monoids and their test complexity , 1989, [1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[2]  J. Patel,et al.  Testing in two-dimensional iterative logic arrays , 1987 .

[3]  Narumi Sakashita,et al.  Built-in self-test in a 24 bit floating point digital signal processor , 1990, Proceedings. International Test Conference 1990.

[4]  R. Drefenstadt.  Parametric ASIC-design by CADIC , 1992, [1992] Proceedings The European Conference on Design Automation.

[5]  Michael H. Schulz,et al.  A hierarchical test pattern generation system based on high-level primitives , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Otto Spaniol.  Arithmetik in Rechenanlagen , 1976 .

[7]  John Paul Shen,et al.  The design of two easily-testable VLSI array multipliers , 1983, 1983 IEEE 6th Symposium on Computer Arithmetic (ARITH).

[8]  Willard L. Miranker,et al.  Computer arithmetic in theory and practice , 1981, Computer science and applied mathematics.

[9]  Bernd Becker,et al.  Optimal-time multipliers and C-testability , 1990, SPAA '90.

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

[11]  Bernd Becker,et al.  Hierarchical Design Based on a Calculus of Nets , 1987, 24th ACM/IEEE Design Automation Conference.

[12]  Sung Je Hong.  An easily testable parallel multiplier , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[13]  Uwe Sparmann.  Strukturbasierte Testmethoden für arithmetische Schaltkreise , 1991 .

[14]  Bernd Becker,et al.  Regular Structures and Testing: RCC-Adders , 1988, AWOC.

[15]  Hideo Fujiwara,et al.  The Complexity of Fault Detection Problems for Combinational Logic Circuits , 1982, IEEE Transactions on Computers.

[16]  Michael H. Schulz,et al.  Advanced automatic test pattern generation and redundancy identification techniques , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[17]  Thomas W. Williams,et al.  A logic design structure for LSI testability , 1977, DAC '77.

[18]  Peter R. Cappello,et al.  Systolic Super Summation , 1988, IEEE Trans. Computers.

[19]  E. L. Harder,et al.  The Institute of Electrical and Electronics Engineers, Inc. , 2019, 2019 IEEE International Conference on Software Architecture Companion (ICSA-C).

[20]  J. Vuillemin,et al.  Recursive implementation of optimal time VLSi integer multipliers , 1984 .