The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (1993 vol.4)
pp: 198-221
ABSTRACT
<p>The algorithm-based fault tolerance techniques have been proposed to obtain reliableresults at very low hardware overhead. Even though 100% fault coverage can betheoretically obtained by using these techniques, the system performance, i.e., faultcoverage and throughput, can be drastically reduced due to many practical problems,e.g., round-off errors. A novel algorithm-based fault tolerance scheme is proposed forfast Fourier transform (FFT) networks. It is shown that the proposed scheme achieves100% fault coverage theoretically. An accurate measure of the fault coverage for FFTnetworks is provided by taking the round-off error into account. The proposed scheme isshown to provide concurrent error detection capability to FFT networks with lowhardware overhead, high throughput, and high fault coverage.</p>
INDEX TERMS
Index Termsconcurrent error detection scheme; FFT networks; algorithm-based fault tolerancetechniques; system performance; fault coverage; round-off errors; digital signalprocessing chips; error detection; fast Fourier transforms; fault tolerant computing;roundoff errors
CITATION
D.L. Tao, C.R.P. Hartmann, "A Novel Concurrent Error Detection Scheme for FFT Networks", IEEE Transactions on Parallel & Distributed Systems, vol.4, no. 2, pp. 198-221, February 1993, doi:10.1109/71.207595
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool