Abstract
In this paper 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. CVS circuits are dynamic CMOS circuits which can implement both inverting and noninverting functions. If the parity tree consists of only differential cascode voltage switch (DCVS) EX-OR gates then we show that the test set consists of at most only 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 such a tree we show that the test set has only eight vectors. We have already introduced the concept of a strongly self-checking (SSC) property for checkers. We show that for an 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.
Original language | English (US) |
---|---|
Pages (from-to) | 179-189 |
Number of pages | 11 |
Journal | IEEE Transactions on Computers |
Volume | 42 |
Issue number | 2 |
DOIs | |
State | Published - Feb 1993 |
All Science Journal Classification (ASJC) codes
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics
Keywords
- Cascode voltage switch logic
- concurrent error detection
- dynamic CMOS
- parity checker
- parity tree
- self-checking
- two-rail checker