A Novel Concurrent Error Detection Technique for the Fast Fourier Transform
Files in This Item:
|reviriego_bleakley_maestra_2012a.pdf||111.41 kB||Adobe PDF||Download|
|Title:||A Novel Concurrent Error Detection Technique for the Fast Fourier Transform||Authors:||Reviriego, P.
Bleakley, Chris J.
|Permanent link:||http://hdl.handle.net/10197/3860||Date:||Jun-2012||Abstract:||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.||Type of material:||Conference Publication||Publisher:||The Institution of Engineering and Technology||Copyright (published version):||2012 The Institution of Engineering and Technology||Keywords:||Soft errors;Concurrent error detection||Subject LCSH:||Errors
|Language:||en||Status of Item:||Peer reviewed||Conference Details:||23nd IET Irish Signals and Systems Conference, 28th - 29th June 2012, Maynooth|
|Appears in Collections:||Computer Science Research Collection|
Show full item record
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.