A partitioning approach to design fault-tolerant arithmetic arrays
Resource
Computers and Communications, 1992. Conference Proceedings., Eleventh Annual International Phoenix Conference on
Journal
11th Annual International Phoenix Conference on Computers and Communication, IPCCC 1992 - Proceedings
Pages
432-439
Date Issued
1992-04
Date
1992-04
Author(s)
DOI
N/A
Abstract
An alternative fault-tolerant design in VLSI-based arithmetic arrays using the partitioning technique is presented. The basic concept is that the arithmetic array can be divided into m parts and its operation can be completed through m iterative calculations with some one part. By taking three such parts with a majority-voting technique at each iteration, error correction can be achieved through m-step computations. This leads to the same fault tolerance capability as triple modular redundancy (TMR). The overheads of chip area and operation time are only introduced by multiplexers, latches, and voters and can be reduced by selecting an appropriate value of m. Based on the AT2 (where A is the chip area and T is the operation time) measure of VLSI performance, the proposed design is shown to be superior to the general TMR method. Some application-specified tradeoffs between speed performance and area cost are also presented. © 1992 IEEE.
Event(s)
11th Annual International Phoenix Conference on Computers and Communication, IPCCC 1992
Other Subjects
Error correction; Fault tolerance; Fault tolerant computer systems; Integrated circuit design; VLSI circuits; Basic concepts; Fault tolerant design; Fault-tolerance capability; Iterative calculation; Partitioning techniques; Speed performance; Triple modular redundancy; Voting techniques; Iterative methods
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
00200588.pdf
Size
534.12 KB
Format
Adobe PDF
Checksum
(MD5):a5e4c8634c8b169562d2e75d769f5001