Design-for-testability and fault-tolerant techniques for FFT processors
Pages 732 - 741
Abstract
In this paper, we first propose a novel design-for-testability approach based on M-testability conditions for module-level systolic fast Fourier transform (FFT) arrays. Our M-testability conditions guarantee 100% single-module-fault testability with a minimum number of test patterns. Based on this testable design, fault-tolerant approaches at the bit level and the multiply-subtract-add (MSA) module level are proposed, respectively. If the reconfiguration is performed at the bit level, then the FFTBIT network is constructed. Two types of reconfiguration schemes (Type-I FFTMSA and Type-II FFTMSA) are proposed at the MSA module level. Since both the design for testability (DFT) and the design for yield (DFY) issues are considered at the same time for all these proposed approaches, the resulting architectures are simpler as compared with previous works. The reliability of the FFT system increases significantly. The hardware overhead is low--about 12% and 1/2N for the FFTBIT network and the Type-II FFTMSA network, respectively. An experimental chip is also implemented to verify our approaches. Reliabilities and hardware overhead are also evaluated and compared with previous works.
References
[1]
B. W. Johnson, Design and Analysis of Fault Tolerant Digital Systems. Reading, MA: Addison-Wesley, 1989.
[2]
P. K. Lara, Fault Tolerant and Fault Testable Hardware Design. Englewood Cliffs, NJ: Prentice-Hall, 1987.
[3]
S. Laha and J. H. Patel, "Error correction in arithmetic operations using time redundancy," in Proc. 13th Annu. Int. Symp. Fault-Tolerant Computing, Jun. 1983, pp. 298-305.
[4]
E. E. Swartzlander, Jr. et al., "Sign/logarithm arithmetic for FFT implementation," IEEE Trans. Comput., vol. C-32, no. 6, pp. 526-534, Jun. 1983.
[5]
D. L. Tao, C. R. P. Hartmann, and Y. S. Chen, "A novel concurrent error detection scheme for FFT networks," in Proc. Int. Symp. Fault-Tolerant Comput., Jun. 1990, pp. 114-121.
[6]
J. Y. Jou and J. A. Abraham, "Fault-tolerant FFT networks," IEEE Trans. Comput., vol. 37, no. 5, pp. 548-561, May 1988.
[7]
M. Tsunoyama and S. Naito, "A fault-tolerant FFT processor," in Int. Symp. Fault-Tolerant Comput., Jun. 1991, pp. 128-135.
[8]
Y. H. Choi and M. Malek, "A fault-tolerant FFT processor," IEEE Trans. Comput., vol. 37, no. 5, pp. 617-621, May 1988.
[9]
F. Lombardi and J. Muzio, "Concurrent error detection in reconfigurable WSI structures for FFT computation," in Proc. Int. Conf. Wafer Scale Integration, 1991, pp. 46-53.
[10]
H. Fujiwara and S. Toida, "The complexity of fault detection problems for combinational logic circuits," IEEE Trans. Comput., vol. C-31, no. 6, pp. 555-560, Jun. 1982.
[11]
S. K. Lu, C. W. Wu, and S.-Y. Kuo, "Enhancing testability of VLSI arrays for fast Fourier transform," Proc. Inst. Elect. Eng., E, vol. 140, no. 3, pp. 161-166, May 1993.
[12]
C. W. Wu and P. R. Cappello, "Easily testable iterative logic arrays," IEEE Trans. Comput., vol. 31, no. 5, pp. 640-652, May 1990.
[13]
W. H. Kautz, "Testing for faults in combinational cellular logic arrays," in Proc. 8th Annu. Symp. Switching, Automata Theory, 1967, pp. 161-174.
[14]
P. R. Menon and A. D. Friedman, "Fault detection in iterative arrays," IEEE Trans. Comput., vol. C-20, pp. 524-535, May 1971.
[15]
A. D. Friedman, "Easily testable iterative systems," IEEE Trans. Comput., vol. C-22, pp. 1061-1064, Dec. 1973.
[16]
T. H. Chen and L. G. Chen, "Concurrent error-detectable butterfly chip for real-time FFT processing through time redundancy," IEEE J. Solid-State Circuits, vol. 28, no. 5, pp. 537-547, May 1993.
[17]
V. K. Jain, H. A. Nienhaus, D. L. Landis, S. Al-Arian, and C. E. Alvarez, "Wafer scale architecture for an FFT processor," in Proc. Int. Symp. Circuits Systems, 1989, pp. 453-456.
[18]
J. F. Li, S. K. Lu, S. Y. Huang, and C. W. Wu, "Easily testable and fault tolerant FFT butterfly networks," IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process., vol. 47, no. 9, pp. 919-929, Sep. 2000.
[19]
V. K. Jain, H. Hikawa, and E. E. Swartzlander, "Defect tolerance and yield for a wafer scale FFT processor system," in Proc. Int. Conf. Wafer Scale Integration, 1991, pp. 54-60.
[20]
V. Piuri and E. E. Swartzlander, "Time-shared modular redundancy for fault-tolerant FFT processors," in Proc. Int. Symp. Defect Fault Tolerance in VLSI Systems, 1999, pp. 265-273.
[21]
L. Breveglieri and V. Piuri, "A fast pipelined FFT unit," in Proc. Int. Conf. Application Specific Array Processors, 1994, pp. 143-151.
[22]
K. Yamashita, A. Kanasugi, S. Hijiya, G. Goto, N. Matsumura, and T. Shirato, "A wafer-scale 170 000-gate FFT processor with built-in test circuits," IEEE J. Solid-State Circuits, vol. 23, no. 2, pp. 336-342, Apr. 1988.
[23]
V. K. Jain, S. A. Al-Arian, D. L. Landis, and H. A. Nienhaus, "Fully parallel and testable WSI architecture for an FFT processor," Int. J. Comput.-Aided VLSI Des., vol. 3, pp. 113-131, 1991.
[24]
A. Antola and M. G. Sami, "Testing and diagnosis of FFT arrays," J. VLSI Signal Process., vol. 3, pp. 225-236, 1991.
[25]
C. Feng, J. C. Muzio, and F. Lombardi, "On the testability of the array structures for FFT computation," J. Electron. Testing: Theory Applicat., vol. 4, pp. 215-224, Aug. 1993.
- Design-for-testability and fault-tolerant techniques for FFT processors
Recommendations
Efficient FFT network testing and diagnosis schemes
We consider offline testing, design-for-testability, and diagnosis for fast Fourier transform (FFT) networks. A practical FFT chip can contain millions of gates, so effective testing and fault-tolerance techniques usualiy are required in order to ...
A New Hybrid Algorithm for Computing a Fast Discrete Fourier Transform
In this paper for certain long transform lengths, Winograd's algorithm for computing the discrete Fourier transform (DFT) is extended considerably. This is accomplisbed by performing the cyclic convolution, required by Winograd's method, with the ...
Bidirectional conversion between DCT coefficients of blocks and their subblocks
Part IIn the context of the discrete Fourier transform (DFT) and the discrete cosine transform (DCT), we present efficient methods for bidirectional conversion between transform coefficients of a signal block (one- or two-dimensional) and transform ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 2005.
Publisher
IEEE Educational Activities Department
United States
Publication History
Published: 01 June 2005
Revised: 26 November 2004
Received: 10 September 2003
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 16 Nov 2024
Other Metrics
Citations
View Options
View options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in