Abstract
Totally self-checking (TSC) circuits are considered. If the first erroneous output is a noncodeword then the TSC goal is said to be achieved. The author has recently defined a new class of checkers which meet the TSC goal, namely, the strongly self-checking (SSC) checkers. A TSC or SSC checker can be guaranteed to meet the TSC goal if it receives the required set of codeword tests from the functional circuit. However, in practice, it is not always possible to ensure this for embedded checkers. A design for a sufficiently strongly self-checking (SSSC) embedded checker for systematic and separable codes is presented. SSSC checkers can be used when it is impossible to design a TSC or SSC checker based on the available set of codewords from the functional circuit.
| Original language | English (US) |
|---|---|
| Pages | 120-123 |
| Number of pages | 4 |
| State | Published - 1989 |
| Event | Proceedings - 1989 IEEE International Conference on Computer Design: VLSI in Computers & Processors - Cambridge, MA, USA Duration: Oct 2 1989 → Oct 4 1989 |
Other
| Other | Proceedings - 1989 IEEE International Conference on Computer Design: VLSI in Computers & Processors |
|---|---|
| City | Cambridge, MA, USA |
| Period | 10/2/89 → 10/4/89 |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
- Electrical and Electronic Engineering