Subscribe

Issue No.04 - April (1994 vol.43)

pp: 490-495

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.278488

ABSTRACT

<p>Bose has developed a parallel unordered coding scheme using only r checkbits for 2/sup r/ information 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. The authors describe a modular, economical, and easily testable totally self-checking (TSC) checker design for the above code. The TSC concept is well known for providing concurrent error detection of transient as well as permanent faults. The 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(log/sub 2/ k). This is the first known TSC checker design for this code.</p>

INDEX TERMS

error detection codes; logic design; built-in self test; parallel algorithms; self-checking checker; parallel unordered coding scheme; unidirectional errors; parallel encoding/decoding; information symbols; checkbits; concurrent error detection; TSC checker; error-detecting codes; totally self-checking checker; transient faults; unordered codes.

CITATION

S.W. Burns, N.K. Jha, "A Totally Self-Checking Checker for a Parallel Unordered Coding Scheme",

*IEEE Transactions on Computers*, vol.43, no. 4, pp. 490-495, April 1994, doi:10.1109/12.278488