1. Lesson Title: Fast Fourier Transform Overview Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas http://rfidsecurity.uark.edu 1 This material is based upon work supported by the National Science Foundation under Grant No. DUE-0736741. Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation (NSF). Copyright © 2008, 2009 by Dale R. Thompson {d.r.thompson@ieee.org}

2. Fourier Analysis Do you remember in Differential Equations about transforming a problem using the Laplace Transform and then solving the problem algebraically? – This is analogous to Fourier Analysis – In Fourier Analysis, we decompose the signals into sinusoids. http://rfidsecurity.uark.edu 2

3. Why sinusoids? Sinusoidal fidelity – Only amplitude and phase change – Frequency and shape stay the same http://rfidsecurity.uark.edu 3

4. Aperiodic-Continuous Signal Requires Fourier Transform http://rfidsecurity.uark.edu 4

5. Periodic-Continuous Signal Requires Fourier Series http://rfidsecurity.uark.edu 5

6. Aperiodic-Discrete Signal Requires Discrete Time Fourier Transform http://rfidsecurity.uark.edu 6

7. Periodic-Discrete Signal Requires Discrete Fourier Transform http://rfidsecurity.uark.edu 7

8. Math Issues All signals are from -∞ to +∞ How do we apply a transform to go from time domain to frequency domain? – Assume left and right of signal are zero Therefore, use Discrete Time Fourier Transform Problem: An aperiodic signal requires ∞ number of sinusoids! – Assume left and right of signal are duplicates. Make finite data look like infinite length signal. Use Discrete Fourier Transform Advantages – A periodic signal requires a finite number of sinusoids – Efficient implementation Disadvantages? http://rfidsecurity.uark.edu 8

9. Main Point A time domain signal can be represented by a combination of sine and cosine functions at different magnitudes and frequencies http://rfidsecurity.uark.edu 9

10. Fast Fourier Transform (FFT) Math Introduction FFT is an efficient implementation Each sample point represented by a complex number We use the complex number to represent magnitude and phase http://rfidsecurity.uark.edu 10

11. FFT High-Level View http://rfidsecurity.uark.edu 11

12. Fast Fourier Transform (FFT) Output However, Octave starts indexing at 1 instead of zero! Therefore, add one to indexes below. http://rfidsecurity.uark.edu 12

13. FFT in Octave http://rfidsecurity.uark.edu 13

14. Time domain signal http://rfidsecurity.uark.edu 14

15. Frequency domain signal Positive and negative frequency http://rfidsecurity.uark.edu 15

16. Frequency domain signal Positive frequencies only http://rfidsecurity.uark.edu 16

17. Sampling Theorem Must sample at twice the rate as the highest frequency component. For example, to sample a 1 KHz sine wave, we must sample at 2 KHz. Maximum k = N/2 Engineering rule of thumb is to sample at four or five times the highest frequency component. http://rfidsecurity.uark.edu 17

18. Contact Information Dale R. Thompson, Ph.D., P.E. Associate Professor Computer Science and Computer Engineering Dept. JBHT – CSCE 504 1 University of Arkansas Fayetteville, Arkansas 72701-1201 Phone: +1 (479) 575-5090 FAX: +1 (479) 575-5339 E-mail: d.r.thompson@ieee.org WWW: http://comp.uark.edu/~drt/ http://rfidsecurity.uark.edu 18

19. Copyright Notice, Acknowledgment, and Liability Release Copyright Notice – This material is Copyright © 2008, 2009 by Dale R. Thompson. It may be freely redistributed in its entirety provided that this copyright notice is not removed. It may not be sold for profit or incorporated in commercial documents without the written permission of the copyright holder. Acknowledgment – These materials were developed through a grant from the National Science Foundation at the University of Arkansas. Any opinions, findings, and recommendations or conclusions expressed in these materials are those of the author(s) and do not necessarily reflect those of the National Science Foundation or the University of Arkansas. Liability Release – The curriculum activities and lessons have been designed to be safe and engaging learning experiences and have been field-tested with university students. However, due to the numerous variables that exist, the author(s) does not assume any liability for the use of this product. These curriculum activities and lessons are provided as is without any express or implied warranty. The user is responsible and liable for following all stated and generally accepted safety guidelines and practices. http://rfidsecurity.uark.edu 19