Fault-tolerant arithmetic via time-shared TMR

Details Fault-tolerant arithmetic via time-shared TMR Fault-tolerant arithmetic via time-shared TMR

Nov 1999

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1999spie.3807...84s&link_type=abstract

Proc. SPIE Vol. 3807, p. 84-92, Advanced Signal Processing Algorithms, Architectures, and Implementations IX, Franklin T. Luk; E

Computer Science

Scientific paper

Fault tolerance is increasingly important as society has come to depend on computers for more and more aspects of daily life. The current concern about the Y2K problems indicates just how much we depend on accurate computers. This paper describes work on time- shared TMR, a technique which is used to provide arithmetic operations that produce correct results in spite of circuit faults.

Affiliated with

Also associated with

No associations

Rating

Fault-tolerant arithmetic via time-shared TMR does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fault-tolerant arithmetic via time-shared TMR, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fault-tolerant arithmetic via time-shared TMR will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1513563