메뉴 건너뛰기




Volumn 50, Issue 7, 2003, Pages 858-864

Fault-tolerant computations over replicated finite rings

Author keywords

Fault tolerant computation; Modulus replication; Parallel algorithms; Residue arithmetic; Symmetric modulus replication residue number system (SMRRNS)

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; DIGITAL ARITHMETIC; ERROR CORRECTION; INTERPOLATION; PARALLEL ALGORITHMS; POLYNOMIALS; THEOREM PROVING;

EID: 0041672397     PISSN: 10577122     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCSI.2003.814085     Document Type: Article
Times cited : (18)

References (18)
  • 1
    • 0029318942 scopus 로고
    • Fault tolerant arithmetic unit using duplication and residue codes
    • June
    • J. M. Tahir, S. S. Dlayand, R. N. Gorgui-Naguib, and O. R. Hinton, "Fault tolerant arithmetic unit using duplication and residue codes," Integr. VLSI J., vol. 18, no. 2-3, pp. 187-200, June 1995.
    • (1995) Integr. VLSI J. , vol.18 , Issue.2-3 , pp. 187-200
    • Tahir, J.M.1    Dlayand, S.S.2    Gorgui-Naguib, R.N.3    Hinton, O.R.4
  • 2
    • 0033332264 scopus 로고    scopus 로고
    • Fault-tolerant arithmetic via time-shared TMR
    • E. E. Swartzlander, "Fault-tolerant arithmetic via time-shared TMR," Proc. SPIE, Int. Soc. Opt. Eng., vol. 3807, pp. 84-92, 1999.
    • (1999) Proc. SPIE, Int. Soc. Opt. Eng. , vol.3807 , pp. 84-92
    • Swartzlander, E.E.1
  • 4
    • 0021439162 scopus 로고
    • Algorithmic-based fault tolerance for matrix operations
    • June
    • K.-H. Huang and J. A. Abraham, "Algorithmic-based fault tolerance for matrix operations," IEEE Trans. Comput., vol. C-33, pp. 518-528, June 1984.
    • (1984) IEEE Trans. Comput. , vol.C-33 , pp. 518-528
    • Huang, K.-H.1    Abraham, J.A.2
  • 6
    • 0030400238 scopus 로고    scopus 로고
    • A new algorithm for RNS decoding
    • December
    • Y. Wang and M. Abd-El-Barr, "A new algorithm for RNS decoding," IEEE Trans. Circuits Syst. I, vol. 43, pp. 998-1000, December 1996.
    • (1996) IEEE Trans. Circuits Syst. I , vol.43 , pp. 998-1000
    • Wang, Y.1    Abd-El-Barr, M.2
  • 7
    • 0037188458 scopus 로고    scopus 로고
    • Residue polynomial systems
    • P. R. Turner, "Residue polynomial systems," Theor. Comput.Sci., vol. 279, no. 1/2, pp. 29-49, 2002.
    • (2002) Theor. Comput.Sci. , vol.279 , Issue.1-2 , pp. 29-49
    • Turner, P.R.1
  • 8
    • 0018545449 scopus 로고
    • How to share a secret
    • A. Shamir, "How to share a secret," Commun. ACM, vol. 22, no. 11, pp. 612-613, 1979.
    • (1979) Commun. ACM , vol.22 , Issue.11 , pp. 612-613
    • Shamir, A.1
  • 9
    • 0020734593 scopus 로고
    • The design of error checkers for self-checking residue number arithmetic
    • Apr.
    • W. K. Jenkins, "The design of error checkers for self-checking residue number arithmetic," IEEE Trans. Comput., vol. C-32, pp. 388-396, Apr. 1983.
    • (1983) IEEE Trans. Comput. , vol.C-32 , pp. 388-396
    • Jenkins, W.K.1
  • 10
    • 0025470947 scopus 로고
    • On modulus replication for residue arithmetic computations of complex inner products
    • Aug.
    • N. M. Wigley and G. A. Jullien, "On modulus replication for residue arithmetic computations of complex inner products," IEEE Trans. Comput., vol. 39, pp. 1065-1076, Aug. 1990.
    • (1990) IEEE Trans. Comput. , vol.39 , pp. 1065-1076
    • Wigley, N.M.1    Jullien, G.A.2
  • 11
    • 0028262751 scopus 로고
    • Large dynamic range computations over small finite rings
    • Jan.
    • N. M. Wigley, G. A. Jullien, and D. Reaume, "Large dynamic range computations over small finite rings," IEEE Trans. Comput., vol. 43, pp. 78-86, Jan. 1994.
    • (1994) IEEE Trans. Comput. , vol.43 , pp. 78-86
    • Wigley, N.M.1    Jullien, G.A.2    Reaume, D.3
  • 12
    • 0030291258 scopus 로고    scopus 로고
    • High throughput VLSI DSP using replicated finite rings
    • G. A. Jullien, W. Luo, and N. M. Wigley, "High throughput VLSI DSP using replicated finite rings," J. VLSI Signal Processing, vol. 14, pp. 207-220, 1996.
    • (1996) J. VLSI Signal Processing , vol.14 , pp. 207-220
    • Jullien, G.A.1    Luo, W.2    Wigley, N.M.3
  • 13
    • 0035953589 scopus 로고    scopus 로고
    • Fault-tolerant computation of large inner-products
    • L. Imbert and G. A. Jullien, "Fault-tolerant computation of large inner-products," Electron. Lett., vol. 37, no. 9, pp. 551-552, 2001.
    • (2001) Electron. Lett. , vol.37 , Issue.9 , pp. 551-552
    • Imbert, L.1    Jullien, G.A.2
  • 14
    • 0034159175 scopus 로고    scopus 로고
    • Arithmetic division in RNS using Galois field GF(p)
    • S. Talahmed and P. Siy, "Arithmetic division in RNS using Galois field GF(p)," Comput. Math. Applicat., vol. 39, no. 5/6, pp. 227-238, 2000.
    • (2000) Comput. Math. Applicat. , vol.39 , Issue.5-6 , pp. 227-238
    • Talahmed, S.1    Siy, P.2
  • 15
    • 0003280114 scopus 로고    scopus 로고
    • The art of computer programming
    • Reading, MA: Addison-Wesley
    • D. E. Knuth, "The Art of computer programming," in Seminumerical Algorithms, 3rd ed. Reading, MA: Addison-Wesley, 1997, vol. 2.
    • (1997) Seminumerical Algorithms, 3rd Ed. , vol.2
    • Knuth, D.E.1
  • 16
    • 0027629366 scopus 로고
    • Fast fault-tolerant digital convolution using a polynomial residue number system
    • July
    • P. E. Beckmann and B. R. Musicus, "Fast fault-tolerant digital convolution using a polynomial residue number system," IEEE Trans. Signal Processing, vol. 41, pp. 2300-2313, July 1993.
    • (1993) IEEE Trans. Signal Processing , vol.41 , pp. 2300-2313
    • Beckmann, P.E.1    Musicus, B.R.2
  • 17
  • 18
    • 0003783197 scopus 로고    scopus 로고
    • Exploiting redundancy in modulus replication inner product processors
    • Ph.D. dissertation, Dept. Elect. Eng., Univ. of Windsor, Windsor, ON, Canada
    • M. Shahkarami, "Exploiting redundancy in modulus replication inner product processors," Ph.D. dissertation, Dept. Elect. Eng., Univ. of Windsor, Windsor, ON, Canada, 1999.
    • (1999)
    • Shahkarami, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.