@article{feb6bdaa3a494113a3978f6698ede39e,

title = "A Totally Self-Checking Checker for a Parallel Unordered Coding Scheme",

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.",

keywords = "All-unidirectional error-detecting codes, codes, concurrent er-, ror detection, totally self-checking checker, transient faults, unordered",

author = "Burns, {Steven W.} and Jha, {Niraj K.}",

note = "Funding Information: Error-detecting codes are classified by the type and number of errors they can detect. Unidirectional errors are very common in VLSI circuits [6]-[8]. Unidirectional errors cause zeros to change to ones or ones to change to zeros, but not both at the same time in a given data word. Unordered codes are needed to detect all possible unidirectional errors that can occur. Such codes are called unordered because it is not possible to convert one codeword into another by changing either only ones to zeros or only zeros to ones. These codes are sometimes also called all-unidirectional error detecting (AUED). The m-out-of-n codes, whose codewords have length n and weight m, have been shown to be optimal AUED codes [9]. However, these codes are nonsystematic, which means that their information bits and check bits are not separately identifiable. This does not allow data manipulation and encoding/decoding to be performed in Manuscript received July 2, 1992; revised March 22, 1993. This work was supported by National Science Foundation under Grant MIP-9010433. This correspondence is based on “A Totally Self-checking Checker for a Parallel Unordered Coding Scheme,” by S. W. Bums and N.K. Jha, a paper that appeared in F{\textquoteright}ROC. IEEE VLSI TEST SYMP.,A tlantic City, NJ, Apr. 1992, pp. 165-170, 01992 IEEE. S. W. Bums is with International Paper Co., Androscoggin Mill, Jay, ME 04239. N.K. Jha is with the Department of Electrical Engineering, Princeton University, Princeton, NJ 08544. IEEE Log Number 9213774.",

year = "1994",

month = apr,

doi = "10.1109/12.278488",

language = "English (US)",

volume = "43",

pages = "490--495",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

publisher = "IEEE Computer Society",

number = "4",

}