|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| 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. | |||
| BibTex | x | ||
| @article{ 10.1109/12.278488, author = {S.W. Burns and N.K. Jha}, title = {A Totally Self-Checking Checker for a Parallel Unordered Coding Scheme}, journal ={IEEE Transactions on Computers}, volume = {43}, number = {4}, issn = {0018-9340}, year = {1994}, pages = {490-495}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.278488}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - A Totally Self-Checking Checker for a Parallel Unordered Coding Scheme IS - 4 SN - 0018-9340 SP490 EP495 EPD - 490-495 A1 - S.W. Burns, A1 - N.K. Jha, PY - 1994 KW - 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. VL - 43 JA - IEEE Transactions on Computers ER - | |||
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.
[1] X. Castillo, S. R. McConnel, and D. P. Siewiorek, "Derivation and calibration of a transient error reliability model,"IEEE Trans. Comput., vol. C-31, pp. 658-671, July 1982.
[2] Y. Savaria, N. C. Rumin, J. F. Hayes, and V. K. Agarwal, "Soft-error filtering: A solution to the reliability problem of future VLSI digital circuits,"Proc. IEEE, vol. 74, no. 5, pp. 669-683, May 1986.
[3] M. M. Yen, W. K. Fuchs, and J. A. Abraham, "Designing for concurrent error detection in VLSI: Application to a microprogram control unit,"IEEE J. Solid-State Cir., vol. SC-22, pp. 595-605, Aug. 1987.
[4] W. C. Carter and P. R. Schneider, "Design of dynamically checked computers," inProc. IFIP '68, vol. 2, Edinburgh, Scotland, Aug. 1968, pp. 878-883.
[5] D. A. Anderson and G. Metze, "Design of totally self-checking circuits form-out-of-ncodes,"IEEE Trans. Comput., vol. C-22, pp. 263-269, Mar. 1973.
[6] R. W. Cook, W. H. Sisson, T. F. Storey, and W. N. Toy, "Design of a self-checking microprogram control,"IEEE Trans. Comput., vol. C-22, pp. 255-262, Mar. 1973.
[7] D. K. Pradhan and J. J. Stiffler, "Error correcting codes and self-checking circuits in fault-tolerant computers,"IEEE Computer, vol. 13, pp. 27-37, Mar. 1980.
[8] G. P. Mak, J. A. Abraham, and E. S. Davidson, "The design of PLAs with concurrent error detection," inProc. Int. Symp. Fault-Tolerant Comput., Santa Monica, CA, June 1982, pp. 303-310.
[9] C. V. Frieman, "Optimal error detecting codes for completely asymmetric binary channels,"Inform. Contr., vol. 5, pp. 64-71, Mar. 1962.
[10] J. M. Berger, "A note on error detecting codes for asymmetric channels,"Inform. Contr., vol. 4, pp. 68-73, Mar. 1961.
[11] D. K. Pradhan, "A new class of error correcting/detecting codes for fault tolerant applications,"IEEE Trans. Comput., vol. C-29, pp. 471-481, June 1980.
[12] D.E. Knuth, "Efficient balanced codes,"IEEE Trans. Inform. Theory, vol. IT-32, no. 1, pp. 51-53, Jan. 1986.
[13] B. Bose, "On unordered codes," inProc. Int. Symp. Fault-Tolerant Comput., Pittsburgh, PA, June 1987, pp. 102-107.
[14] M. Ashjaee and S.M. Reddy, "On totally self-checking checkers for separable codes,"IEEE Trans. Comput., vol. C-26, pp. 737-744, Aug. 1977.
[15] M. A. Marouf and A. D. Friedman, "Design of self-checking checkers for Berger codes," inProc. Int. Symp. Fault-Tolerant Comput., pp. 179-184, June 1978.
[16] S. J. Piestrak, "Design of fast self-testing checkers for a class of Berger codes,"IEEE Trans. Comput., vol. C-36, no. 5, pp. 629-634, May 1987.
[17] J.-Ch. Lo and S. Thanawastien, "The design of fast totally self-checking Berger code checkers," inDig. Papers 18th Int. FTC Symp., Tokyo, Japan, July 1988, pp. 226-231.
[18] Y. Tamir and C.H. Sequin, "Design and application of self-testing comparators implemented with MOS PLA's,"IEEE Trans. Comput., vol. 33, pp. 493-506, June 1984.
[19] D. A. Anderson, "Design of self-checking digital networks using coding techniques," Univ. of Illinois, IL, Tech. Rep. R-527, CSL, 1971.