Fast Fourier Transform Approach for Signal Analysis

Authors

  • K. R. Chaudhari  Assistant Professor, Department of Electronics, Shree J. P. Arts & Science College, Bharuch, Gujarat, India

Keywords:

FFT, DFT, Twiddle factor, MATLAB, Window.

Abstract

Fourier analysis converts time domain signal into frequency domain signal and vice versa and fast Fourier transform (FFT) is a mathematical tool which convert discrete time domain signal into frequency domain signal. FFT are widely used for many applications such as mathematics, engineering and science. FFT have been described as the most important numerical algorithms of our life. This paper focused on FFT and described about FFT and its MATLAB implementation. The FFT spectrums for the outputs are analyzed.

References

  1. Grewal B. S., Grewal J. S., (2007), Higher Engineering Mathematics, Khanna Publishers, 40th edition, ISBN No. 81-7409-195-5.
  2. John G. Proakis, Dimitris K Manolakis, (2006), Digital Signal Processing (4th Edition), ISBN-13: 978-0131873742.
  3. Steven W. Smith, 1997, The Scientist and Engineer's Guide to Digital Signal Processing, California Technical Publishing, ISBN 0-9660176-3-3, 1997.
  4. Emmert, J.M., Badhri Jagannathan, Sandeep Umarani, (2003), An FFT approximation technique suitable for on-chip generation and analysis of sinusoidal signals, Defect and Fault Tolerance in VLSI Systems, 2003. Proceedings. 18th IEEE International Symposium, pp 361-368, 3-5 Nov. 2003.
  5. Namburi N. R., and Barton T. H., “Time Domain Response of Induction Motors with PWM Supplies”, IEEE Trans. Industry Applications, vol. IA – 21, no. 2, pp. 448 – 455, Mar. 1985.
  6. Sample page from Numerical Recipes in FORTRAN 77: The Art of Scientific Computing (ISBN 0-521-43064-X) Copyright (C) 1986-1992 by Cambridge University Press.

Downloads

Published

2016-01-25

Issue

Section

Research Articles

How to Cite

[1]
K. R. Chaudhari, " Fast Fourier Transform Approach for Signal Analysis, International Journal of Scientific Research in Science and Technology(IJSRST), Online ISSN : 2395-602X, Print ISSN : 2395-6011, Volume 2, Issue 1, pp.179-183, January-February-2016.