A Totally Self-Checking Checker for a Parallel Unordered Coding Scheme

Steven W. Burns, Niraj K. Jha

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

Bose has developed a parallel unordered coding scheme using only r checkbits for 2rinformation bits. This code can detect all unidirectional errors and requires simple parallel encoding/decoding. The information symbols can be separated from the check symbols. However, the information symbols containing all zeros and all ones need to be transformed to two other information symbols. This allows one to reduce the number of checkbits over Berger code by 1. Since information symbols containing a power-of-two number of bits are quite common, this coding scheme should become quite popular. In this brief contribution, a modular, economical, and easily testable totally self-checking (TSC) checker design for the above code is described. The TSC concept is well known for providing concurrent error detection of transient as well as permanent faults. Our design is self-testing with at most only 2r + 16 codeword tests. This means that if k is the number of information bits, the size of the codeword test set is only O(log2k). This is the first known TSC checker design for this code.

Original languageEnglish (US)
Pages (from-to)490-495
Number of pages6
JournalIEEE Transactions on Computers
Volume43
Issue number4
DOIs
StatePublished - Apr 1994

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Keywords

  • All-unidirectional error-detecting codes
  • codes
  • concurrent er-
  • ror detection
  • totally self-checking checker
  • transient faults
  • unordered

Fingerprint Dive into the research topics of 'A Totally Self-Checking Checker for a Parallel Unordered Coding Scheme'. Together they form a unique fingerprint.

Cite this