DefinePK

Abstract

In the present Digital Communication systems, it is highly possible that the data or message get corrupted during transmission and reception through a noisy channel medium which leads to the injection of random bits into the original message and corrupt the original message. For some applications, an option is to use Algorithmic-Based Fault Tolerance (ABFT) techniques that try to exploit the algorithmic properties to detect and correct errors. One example is Fast Fourier transforms (FFTs) that is used in spectral analysis in the communication for Time to Frequency transform in the receiver side. There are several protection schemes to detect and correct errors in FFTs. The Parseval or sum of square check is the most widely known. It is most common to find several blocks operating in parallel in the modern communication systems. Recently, a new technique called Fault tolerant parallel filters has been proposed. In this work same technique is first applied to protect Cordic based FFT and then the protection schemes that combine the use of Error Correction Codes and Parseval checks are proposed and the area reduction of 12% was observed. The Power, area and delay is analyzed in Cadence using 180 nm Technology for 8-pointprotected FFT with input 32 bit length. Simulation and Compilation report for FFT using ECC, SOS and ECC-SOS are obtained in Modelsim-Altera 6.4a and Quartus II 9.0.