Journal Article


J.A. Maestro
P. Reviriego
Chris J. Bleakley


Computer Science

fft computational complexity fast fourier transform fast fourier transforms concurrent error detection time frequency domain soft errors convolution

Low-Complexity Concurrent Error Detection for Convolution with Fast Fourier Transforms (2011)

Abstract In this paper, a novel low-complexity Concurrent Error Detection (CED) technique for Fast Fourier Transform-based convolution is proposed. 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 convolution input blocks and of two consecutive output blocks. The approach provides low computational complexity since it re-uses the results of the convolution computation for CED checking. Hence, the number of extra calculations needed purely for CED is significantly reduced. When compared with a conventional Sum Of Squares - Dual Modular Redundancy technique, the proposal provides similar error coverage for isolated soft errors at significantly reduced computational complexity. For an input sequence consisting of complex numbers, the proposal reduces the number of real multiplications required for CED in adaptive and fixed filters by 60% and 45%, respectively. For input sequences consisting of real numbers, the reductions are 66% and 54%, respectively.
Collections Ireland -> University College Dublin -> School of Computer Science
Ireland -> University College Dublin -> Computer Science Research Collection

Full list of authors on original publication

J.A. Maestro, P. Reviriego, Chris J. Bleakley

Experts in our system

Chris Bleakley
University College Dublin
Total Publications: 105