Logical redundancies in irredundant combinational circuits |
| |
| Authors: | Susanta Chakraborty Debesh K. Das Bhargab B. Bhattacharya |
| |
| Affiliation: | (1) Institute of Jute Technology, 700 019 Calcutta, India;(2) Department of Computer Science, University of Calcutta, 700 009 Calcutta, India;(3) Indian Statistical Institute, 700 035 Calcutta, Indta |
| |
| Abstract: | 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. |
| |
| Keywords: | Boolean functions combinational circuits fanouts irredundancy stuck-at faults testing |
| 本文献已被 SpringerLink 等数据库收录！ |
|
