메뉴 건너뛰기




Volumn , Issue , 1996, Pages 186-193

Achieving fault secureness in parity prediction arithmetic operators: General conditions and implementations

Author keywords

Arithmetic operators; Fault secure circuits; Parity prediction; Self checking circuits

Indexed keywords

COMPUTER CIRCUITS;

EID: 85029658872     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EDTC.1996.494147     Document Type: Conference Paper
Times cited : (2)

References (12)
  • 1
    • 0015631041 scopus 로고
    • Arithmetic algorithms for error-coded operands
    • June
    • Avizienis A., 'Arithmetic Algorithms for Error-Coded Operands' IEEE Trans. on Comput., Vol. C-22, No. 6, pp. 567-572, June 1973.
    • (1973) IEEE Trans. on Comput , vol.C-22 , Issue.6 , pp. 567-572
    • Avizienis, A.1
  • 2
    • 0020546940 scopus 로고
    • Logic design of fault tolerant dividers based on data complementation strategy
    • Milan, Italy, June
    • Furuya K., Akita Y., Tohma Y., "Logic design of Fault Tolerant Dividers based on Data complementation Strategy", 13th Intl Symp. Fault Tolerant Comp., Milan, Italy, June 1983.
    • (1983) 13th Intl Symp. Fault Tolerant Comp
    • Furuya, K.1    Akita, Y.2    Tohma, Y.3
  • 6
    • 0027844138 scopus 로고
    • Efficient implementation of self-checking adders and alus'
    • Toulouse France, June
    • Nicolaidis M. 'Efficient Implementation of Self-Checking Adders and ALUs'. Proc. 23th Fault Tolerant Computing Symposium, Toulouse France, June 1993.
    • (1993) Proc. 23th Fault Tolerant Computing Symposium
    • Nicolaidis, M.1
  • 7
    • 0028134603 scopus 로고
    • Efficient implementation of self-checking multiply and divide arrays'
    • Paris, February 28-March 3
    • Nicolaidis M. Bedder H. 'Efficient Implementation of Self-Checking Multiply and Divide Arrays'. Proc. 1994 European Design and Test Conference, Paris, February 28-March 3, 1994.
    • (1994) Proc. 1994 European Design and Test Conference
    • Nicolaidis, M.1    Bedder, H.2
  • 11
    • 0008494940 scopus 로고
    • On the check base selection problem for fast adders
    • Atlantic City, NJ, April
    • Sparmann U. 'On the Check Base Selection Problem for Fast Adders' Proc. 11th VLSI Test Symposium, Atlantic City, NJ, April 1993.
    • (1993) Proc. 11th VLSI Test Symposium
    • Sparmann, U.1
  • 12
    • 0027961964 scopus 로고
    • On the effectiveness of residue code checking for parallel two's complement multipliers'
    • Austin Texas, June
    • Sparmann U. Reddy S.M. 'On the Effectiveness of Residue Code Checking for Parallel Two's Complement Multipliers' Proc. 24th Fault Tolerant Computing Symposium, Austin Texas, June 1994.
    • (1994) Proc. 24th Fault Tolerant Computing Symposium
    • Sparmann, U.1    Reddy, S.M.2


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