A novel concurrent error detection technique for the Fast Fourier Transform

A novel Concurrent Error Detection technique for the Fast Fourier Transform (FFT) is proposed in this paper. The technique is similar to the conventional Sum of Squares (SOS) approach but is of lower computational complexity. Complexity reduction is achieved by checking the FFTs of two data blocks in a single calculation. The technique is based on checking the equivalence of the results of time and frequency domain calculations of the first sample of the circular convolution of the two blocks. In the case of error, the FFTs of both blocks must be recomputed. Assuming that errors are rare, this additional cost has negligible impact on the average number of operations per block.