Fault-Tolerant Algorithm for Fast Fourier Transform on Hypercubes

Abstract

This paper presents an efficient fault–tolerant algorithm for Fast Fourier Transform (FFT) with 2n data on an n–dimensional hypercube with n− 1 faulty nodes in 9n − 15 communication steps and O(n) computation steps. To the best of our knowledge, this is the first time that such a fault– tolerant algorithm for FFT on hypercubes is proposed in the literature.