DocumentCode
1102960
Title
Algorithm-based fault tolerance for FFT networks
Author
Wang, Sying-Jyan ; Jha, Niraj K.
Author_Institution
Inst. of Comput. Sci., Nat. Chung-Hsing Univ., Taichung, Taiwan
Volume
43
Issue
7
fYear
1994
fDate
7/1/1994 12:00:00 AM
Firstpage
849
Lastpage
854
Abstract
Algorithm-based fault tolerance (ABFT) is a low-overhead system-level fault tolerance technique. Many ABFT schemes have been proposed in the past for fast Fourier transform (FFT) networks. In this paper, a new ABFT scheme for FFT networks is proposed. We show that the new approach maintains the high throughput of previous schemes, yet needs lower hardware overhead and achieves higher fault converge than previous schemes by J.Y. Jou et al. (1988) and D.I. Tao et al. (1990)
Keywords
fast Fourier transforms; fault tolerant computing; reliability; FFT networks; algorithm-based fault tolerance; high throughput; system-level fault tolerance technique; Circuit faults; Digital signal processing; Discrete Fourier transforms; Fast Fourier transforms; Fault tolerance; Fault tolerant systems; Hardware; Redundancy; Signal processing algorithms; Throughput;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.293265
Filename
293265
Link To Document