Fault Tolerant Parallel FFTs Using Error Correction Codes and Parseval Checks - 2016

PROJECT TITLE :

Fault Tolerant Parallel FFTs Using Error Correction Codes and Parseval Checks - 2016

ABSTRACT:

Soft errors pose a reliability threat to fashionable electronic circuits. This makes protection against soft errors a demand for many applications. Communications and Signal Processing systems aren't any exceptions to the present trend. For some applications, an attention-grabbing possibility is to use algorithmic-based fault tolerance (ABFT) techniques that attempt to use the algorithmic properties to detect and correct errors. Signal Processing and Communication applications are well fitted to ABFT. One example is quick Fourier transforms (FFTs) that are a key building block in several systems. Many protection schemes are proposed to detect and correct errors in FFTs. Among those, most likely the utilization of the Parseval or total of squares check is the foremost widely known. In trendy Communication systems, it is increasingly common to search out many blocks operating in parallel. Recently, a way that exploits this fact to implement fault tolerance on parallel filters has been proposed. During this temporary, this technique is initial applied to shield FFTs. Then, 2 improved protection schemes that combine the employment of error correction codes and Parseval checks are proposed and evaluated. The results show that the proposed schemes will further reduce the implementation cost of protection.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here