论文信息 - Logical redundancies in irredundant combinational circuits

Logical redundancies in irredundant combinational circuits

Some new types of logical redundancies that can occur in a combinational network are investigated. Three kinds of redundancy, namely a-redundancy, b-redundancy and c-redundancy are already well-known. This article presents two new types of redundancy called p-redundancy and n-redundancy in combinational networks which are otherwise known to be irredundant. A combinational circuit is calledp-redundant (n-redundant), if it is possible to realize the same function by permuting (inverting) some input terminals, in the presence of certain stuck-at faults in the circuit.

Susanta Chakraborty | Bhargab B. Bhattacharya | Debesh Kumar Das

[1] F. Brglez,et al. A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN , 1985 .

[2] John P. Hayes. On the Properties of Irredundant Logic Networks , 1976, IEEE Transactions on Computers.

[3] B. Gupta,et al. Anomalous effect of a stuck-at fault in a combinational logic circuit , 1983, Proceedings of the IEEE.

[4] Arthur D. Friedman. Fault Detection in Redundant Circuits , 1967, IEEE Trans. Electron. Comput..

[5] R. Dandapani,et al. On the Design of Logic Networks with Redundancy and Testability Considerations , 1974, IEEE Transactions on Computers.

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

[7] Hideo Fujiwara,et al. On the Acceleration of Test Generation Algorithms , 1983, IEEE Transactions on Computers.

[8] Stanley L. Hurst,et al. Spectral techniques in digital logic , 1985 .