Parallel Error Correction for Parallel FFTs

In modern electronic circuit soft error is reliability in pose. This protects against soft errors and is requirement for many applications. In this trend communication and signal processing systems are not exception. In some applications the interesting choice is used in algorithmic based fault tolerance (ABFT) technology which tries to detect the errors and to correct it. Communication and signal processing units are well suitable for ABFT. An example for the above mentioned ABFT is (FFT) is a building block in some application. An algorithm to compute discrete fourier transform is known as (FFT) Fast Fourier Transform. This FFT converts time domain signals into frequency domain. Hence FFT is used widely in DSP technology and also in rudimentary operations in the field of digital signal and image processing. It is indispensable in most signal processing operations. This paper consists of efficient multiplication technology to reduce the partial product which is banned in conventional multiplication technology. Hence FFT and inverse fast fourier transform (IFFT) with efficient multiplication and with increased speed is used for orthogonal frequency division multiplexing (OFDM) modulation and demodulation blocks. Normally I many application high speed and efficient multiplication is desired. Hence conventional multicarrier technology is chosen, but results in lower spectrum efficiency. So the principle of OFDM are used.