This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Error Correcting Codes Over Z/sub 2(m/) for Algorithm-Based Fault Tolerance
March 1994 (vol. 43 no. 3)
pp. 370-374

Algorithm-based fault tolerance is a scheme of low-cost error protection in real-time digital signal processing environments and other computation-intensive tasks. In this paper, a new method for encoding data is proposed and, furthermore, two kinds of error-correcting codes over Z/sub 2(m/), which can be used with fixed-point arithmetic in practical algorithm-based fault tolerant systems, are introduced.

[1] K. H. Huang and J. A. Abraham, "Algorithm-based fault tolerance for matrix operations,"IEEE Trans. Comput., vol. C-33, no. 6, pp. 518-528, June 1984.
[2] V. S. S. Nair and J. A. Abraham, "'A model for the analysis, design and comparison of fault-tolerant WSI architectures," presented at Workshop on WSI, Como, June 1989.
[3] V. S. S. Nair and J. A. Abraham, "Hierarchical design and analysis of fault-tolerant multiprocessor systems using concurrent error detection," inProc. 20th Int. Symp. Fault-Tolerant Comput., (FTCS-20), Newcastle upon Tyne, June 1990, pp. 130-137.
[4] D. Gu, J. Rosenkrantz, and S. S. Ravi, "Design and analysis of test schemes for algorithm-based fault tolerance," inProc. 20th Int. Symp. Fault-Tolerant Comput., Newcastle, England, June 26-28, 1990, pp. 106-113.
[5] P. Banerjee and J. A. Abraham, "Bounds on algorithm-based fault tolerance in multiple processor systems,"IEEE Trans. Comput., vol. C-35, pp. 296-306, Apr. 1986.
[6] J. Y. Jou and J. A. Abraham, "Fault tolerant matrix arithmetic and signal processing on highly concurrent computing structures,"Proc. IEEE, vol. 74, no. 5, pp. 732-741, May 1986.
[7] F. T. Luk and H. Park, "An analysis of algorithm-based fault tolerance techniques," inProc. SPIE Adv. Alg.&Arch. for Signal Processing, vol. 696, Aug. 1986, pp. 222-228.
[8] J. Y. Jou and J. A. Abraham, "Fault tolerant FFT networks,"IEEE Trans. Comput., vol. 37, no. 5, pp. 548-561, May 1988.
[9] F. T. Luk, "Algorithm-based fault tolerance for parallel matrix equation solvers," inProc. SPIE Real Time Signal Processing VIII, vol. 564, 1985, pp. 49-53.
[10] V. S. S. Nair and J. A. Abraham, "General linear codes for fault tolerant matrix operations on processor arrays," inProc. Int. Symp. Fault-Tolerant Comput., Tokyo, June 1988, pp. 180-185.
[11] C. J. Afinson and F. T. Luk, "A linear algebraic model of algorithm-based fault tolerance,"IEEE Trans. Comput., vol. C-37, no. 12, pp. 1599-1604, Dec. 1988.
[12] I. F. Blake, "Code over certain rings,"Inform. Contr., vol. 20, pp. 396-404, 1972.
[13] E. Siegel, "Codes overZm,"Inform. Contr., vol. 35, pp. 48-52, 1977.
[14] P. Shankar, "On BCH codes over arbitrary integer rings,"IEEE Trans. Inform. Theory, vol. IT-25, no. 4, pp. 480-483, July 1979.
[15] W. W. Peterson and E. J. Weldon, Jr.,Error-Correcting Codes, 2nd ed. Cambridge, MA: MIT Press, 1972.
[16] F. J. MacWilliams and N. J. A. Sloane,The Theory of Error-Correcting Codes. Amsterdam: North-Holland, 1977.
[17] T.R.N. Rao and F. Fujawara,Error Control Codes for Computer Systems, Prentice Hall, 1989.
[18] G. L. Feng, T. R. N. Rao, and M. S. Kolluru, "Error-correcting codes overZ2mand applications in algorithm-based fault tolerance," Univ. of SW Louisiana, LA, Tech. Rep. TR91-7-3, CACS.
[19] G. L. Feng, T. R. N. Rao, and M. S. Kolluru, "An efficient decoding procedure of error-correcting codes overZ2mfor smalltand largem," in preparation.

Index Terms:
error correction codes; encoding; decoding; error correcting codes; algorithm-based fault tolerance; low-cost error protection; real-time digital signal processing; encoding data; fixed-point arithmetic.
Citation:
G.L. Feng, T.R.N. Rao, M.S. Kolluru, "Error Correcting Codes Over Z/sub 2(m/) for Algorithm-Based Fault Tolerance," IEEE Transactions on Computers, vol. 43, no. 3, pp. 370-374, March 1994, doi:10.1109/12.272438
Usage of this product signifies your acceptance of the Terms of Use.