A FAULT-TOLERANT FFT PROCESSOR

被引:50
作者
CHOI, YH [1 ]
MALEK, M [1 ]
机构
[1] UNIV TEXAS,DEPT ELECT & COMP ENGN,AUSTIN,TX 78712
关键词
CODES; SYMBOLIC - Error Detection - MATHEMATICAL TECHNIQUES - Fast Fourier Transforms - REDUNDANCY - RELIABILITY;
D O I
10.1109/12.4614
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A method is proposed for achieving fault tolerance by introducing a redundant stage for a special-purpose fast Fourier transform (FFT) processor. A concurrent error-detection technique, called recomputing by alternate path, is used to detect errors during normal operation. Once an error is detected, a faulty butterfly can be located with log (N plus 5) additional cycles. The method has 100% detection and location capability, regardless of the magnitude of the roundoff errors. A gracefully degraded reconfiguration using a redundant stage is introduced. This technique ensures a high improvement in reliability and availability. Hardware overhead is O(1/log N) with some additional comparators and switches. The method can be applied to other algorithms implementable on the butterfly structure.
引用
收藏
页码:617 / 621
页数:5
相关论文
共 12 条
[1]  
ADAMS GB, 1982, IEEE T COMPUT, V31, P443, DOI 10.1109/TC.1982.1676021
[2]  
BARNERJEE P, 1984, 11TH P ANN INT S COM, P279
[3]  
Beetem J., 1985, 12th Annual International Symposium on Computer Architecture Conference Proceedings (Cat. No. 85CH2144-4), P108
[4]   AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J].
COOLEY, JW ;
TUKEY, JW .
MATHEMATICS OF COMPUTATION, 1965, 19 (90) :297-&
[5]  
GAVERICK SL, 1983 P IEEE CUST INT, P244
[6]   ALGORITHM-BASED FAULT TOLERANCE FOR MATRIX OPERATIONS [J].
HUANG, KH ;
ABRAHAM, JA .
IEEE TRANSACTIONS ON COMPUTERS, 1984, 33 (06) :518-528
[7]  
JOU JY, 1985, 15TH P INT S FAULT T, P338
[8]  
KUNG HT, 1984, JAN MIT C ADV RES VL, P74
[9]  
Leighton F. T., 1982, 23rd Annual Symposium on Foundations of Computer Science, P297, DOI 10.1109/SFCS.1982.49
[10]  
Openheim A., 1975, DIGITAL SIGNAL PROCE