Call For Paper

Volume 8 Issue 9

September 2022

Submit Paper Here
Download Paper Format
Copyright Form
NEWS & UPDATES
News for Authors:

We have started accepting articles by online means directly through website. Its our humble request to all the researchers to go and check the new method of article submission on below link: Submit Manuscript

Follow us on Social Media:

Dear Researchers, to get in touch with the recent developments in the technology and research and to gain free knowledge like , share and follow us on various social media. Facebook

title

DESIGN OF FAST AND LOW COMPLEXITY FAULT TOLERANT FFTS USING PARSEVAL CHECK

Author(s):

Dr.G.Vetrichelvi

Keywords:

Abstract

In most of the recent processors , multimode memory unit is used which needs digital filters to avoid unwanted faults in the process components and in some cases, the reliability of those systems is critical, and fault tolerant filter implementations are needed. A soft error is an issue that causes a temporary condition in RAM that alters stored data in the FFT. First method, the Parity-Partial Summation and Error Correction Codes (ECC) uses one FFT with minimum Partial Sum blocks for reducing hardware area. Parallel Partial Summation ECC used for correcting errors in multiple FFTs protective methods. The result for 4-paralle1 FFTs shows that the proposed technique effectively reduces delay of fault tolerant design by detecting and correcting the multiple errors at a time. The existing methods used the methods to detect and correct the single error in FFT. We have proposed partial summation method to detect and correct multiple errors simultaneously. The result for proposed method shows that it effectively reduces the timing process in detecting and correcting the errors in FFT.

Other Details

Paper ID: IJSARTV
Published in: Volume : 3, Issue : 5
Publication Date: 5/2/2017

Article Preview




Download Article