Fault Detection in CVS Parity Trees with Application to Strongly Self-Checking Parity and Two-Rail Checkers
Issue No.02 - February (1993 vol.42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.204791
<p>The problem of single stuck-at, stuck-open, and stuck-on fault detection in cascode voltage switch (CVS) parity trees is considered. The results are also applied to parity and two-rail checkers. It is shown that, if the parity tree consists of only differential cascode voltage switch (DCVS) EX-OR gates, then the test set consists of at most five vectors (in some cases only four vectors are required) for detecting all detectable single stuck-at, stuck-open, and stuck-on faults, independent of the number of primary inputs and the number of inputs to any EX-OR gate in the tree. If, however, only a single-ended output is desired from the tree, then the final gate will be a single-ended cascode voltage switch (SCVS) EX-OR gate, for which the test set has only eight vectors. For a strongly self-checking (SSC) CVS parity checker, the size of a test set consisting of only codewords is nine, whereas for an SSC CVS two-rail checker the size of a test set consisting of only codewords is at most five.</p>
CVS parity trees; strongly self-checking parity; two-rail checkers; single stuck-at; stuck-open; stuck-on fault detection; cascode voltage switch; differential cascode voltage switch; EX-OR gates; single-ended cascode voltage switch; fault location; logic gates; logic testing.
N.K. Jha, "Fault Detection in CVS Parity Trees with Application to Strongly Self-Checking Parity and Two-Rail Checkers", IEEE Transactions on Computers, vol.42, no. 2, pp. 179-189, February 1993, doi:10.1109/12.204791