Vedic Multiplier based Fault Tolerant FFTs through Verilog HDL

Ganesh Payyavula, Prasad Janga


Algorithmic-Based Fault Tolerance (ABFT) technique is used 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. There are several protection schemes to detect and correct errors in FFTs. Among those, most likely the utilization of the Parseval or add of squares check is that the most generally glorious. 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 method that exploits this truth to implement fault tolerance on parallel filters has been projected. During this temporary, this system is 1st applied to guard FFTs. Then, 2 improved protection schemes that mix the utilization of error correction codes and Parseval checks are projected and evaluated. This project outspread with FFT using Vedic multiplier. Simulation results are observed using Xilinx.

Full Text:


Copyright (c) 2017 Edupedia Publications Pvt Ltd

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.


EduPedia Publications Pvt Ltd, D-351, Prem Nagar-2, Suleman Nagar, Kirari, Nagloi, New Delhi PIN-Code 110086, India Through Phone Call us now: +919958037887 or +919557022047

All published Articles are Open Access at

Paper submission: or


Mobile:                  +919557022047 & +919958037887


Journals Maintained and Hosted by

EduPedia Publications (P) Ltd in Association with Other Institutional Partners

Pen2Print and IJR are registered trademark of the Edupedia Publications Pvt Ltd.