Low-Complexity Concurrent Error Detection for Convolution with Fast Fourier Transforms
Files in This Item:
|Low_Complexity_Concurrent_Error_Detection_for_Fast_Fourier_Transform_based_Convolution.pdf||383.11 kB||Adobe PDF||Download|
|Title:||Low-Complexity Concurrent Error Detection for Convolution with Fast Fourier Transforms||Authors:||Bleakley, Chris J.
|Permanent link:||http://hdl.handle.net/10197/7130||Date:||Jun-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.||Type of material:||Journal Article||Publisher:||Elsevier||Journal:||Microelectronics Reliability||Volume:||51||Issue:||6||Start page:||1152||End page:||1156||Copyright (published version):||2011 Elsevier||Keywords:||Convolution; FFT; Soft Errors||DOI:||10.1016/j.microrel.2011.02.010||Language:||en||Status of Item:||Peer reviewed|
|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.