Reconfiguration of FFT arrays: a flow-driven approach
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 401-413
- https://doi.org/10.1109/asap.1990.145476
Abstract
A new reconfiguration algorithm for defect and fault tolerance in fast Fourier transform (FFT) two-dimensional arrays is presented. The reconfiguration scheme is based on the data flow of the algorithm to minimize the overhead due to the re-routing of information in the reconfigured array. Evaluation of the effectiveness of this approach shows a significant increase in system robustness with respect to other, non-dedicated reconfiguration approaches. Moreover, the possibility of choosing between two reconfiguration algorithms characterized by different complexities and efficiencies results in both an optimal, host-driven reconfiguration (particularly suited for end-of-production yield enhancement) and a fast, self-performed reconfiguration (suited for on-line reliability enhancement).Keywords
This publication has 6 references indexed in Scilit:
- The flexibility dedicated approach: reconfigurable arrays for low-level image processingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Policies for fault-tolerance through mixed space- and time-redundancy in semi-systolic FFT arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Fault-tolerance in FFT arrays: time-redundancy approachesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Multiple-transform pipelines for image codingPublished by Association for Computing Machinery (ACM) ,1988
- An approach to fault-tolerance in architectures for discrete fourier transformsMicroprocessing and Microprogramming, 1986
- Fourier Transforms in VLSIIEEE Transactions on Computers, 1983