This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Residue Arithmetic Error Correction Scheme
January 1996 (vol. 45 no. 1)
pp. 13-19

Abstract—Automatic detection and correction of errors in the residue number system involves the conversion of residue representations to integers and base extension. The residue number system is generally restricted to moduli that are pairwise relatively prime. In this paper we consider error detection and correction using a moduli set with common factors. A method to construct a moduli set that leads to simplified error detection and correction is presented. Error detection can now be performed by computing residues in parallel. Error correction does not involve base extension any more. It is also shown that, removing all restrictions on the moduli set, leads to more complex error detection/correction algorithms.

[1] N.S. Szabo and R.I. Tanaka,Residue Arithmetic and its Application to Computer Technology.New York: McGraw-Hill, 1967.
[2] R.W. Watson and C.W. Hastings,"Self-checked computation using residue arithmetic," Proc. IEEE, vol. 54, pp. 1,920-1,931, Dec. 1966.
[3] D. Mandelbaum,"Error correction in residue arithmetic," IEEE Trans. Computers, vol. 21, pp. 538-545, June 1972.
[4] S.S. Yau and Y.C. Liu,"Error correction in redundant residue number systems," IEEE Trans. Computers, vol. 22, pp. 5-11, Jan. 1973.
[5] F. Barsi and P. Maestrini,"Error correcting properties of redundant residue number systems," IEEE Trans. Computers, vol. 22, pp. 307-315, Mar. 1973.
[6] V. Ramachandran,"Single error correction in residue number systems," IEEE Trans. Computers, vol. 32, pp. 504-507, May 1983.
[7] W.K. Jenkins,"The design of error checkers for self-checking residue number arithmetic," IEEE Trans. Computers, vol. 32, pp. 388-396, Apr. 1983.
[8] M.H. Etzel and W.K. Jenkins,"Redundant residue number systems for error detection and correction in digital filters," IEEE Trans. Acoustics, Speech, Signal Processing, vol. 28, pp. 538-544, Oct. 1980.
[9] R. Wilmhoff and F.J. Taylor,"On hard errors in RNS architectures," IEEE Trans. Acoustics, Speech, Signal Processing, vol. 31, pp. 772-774, June 1983.
[10] J.J. Stone,"Multiple burst correction with the Chinese Remainder theorem," J. SIAM, vol. 11, no. 1, pp. 74-81, Mar. 1963.
[11] E.D. DiClaudio,G. Orlandi,, and F. Piazza,“A systolic redundant residue arithmetic error correction circuit,” IEEE Trans. Computers, vol. 42, no. 4, pp. 427-432, Apr. 1993.
[12] T.R.N. Rao, Error Coding for Arithmetic Processors.New York: Academic Press, 1974.
[13] S.J. Piestrak,"Design of residue generators and multi-operand modular adders using carry-save adders," Proc. 10th Symp. Computer Arithmetic,Grenoble, France, 1991.
[14] R.J. Cosentino,"Fault tolerance in a systolic residue arithmetic processor array," IEEE Trans. Computers, vol. 37, no. 7, pp. 886-890, July 1988.
[15] T.R.N. Rao and Fujiwara, Error-Coding for Computer Systems.Englewood Cliffs, N.J.: Prentice Hall, 1989.

Index Terms:
Error correction, error detection, fault-tolerant computing, parallel algorithms, redundant residue number system, residue number system.
Citation:
Rajendra S. Katti, "A New Residue Arithmetic Error Correction Scheme," IEEE Transactions on Computers, vol. 45, no. 1, pp. 13-19, Jan. 1996, doi:10.1109/12.481482
Usage of this product signifies your acceptance of the Terms of Use.