Asee peer logo

A Taste of Java: Discrete and Fast Fourier Transforms

Download Paper |

Conference

2011 ASEE Annual Conference & Exposition

Location

Vancouver, BC

Publication Date

June 26, 2011

Start Date

June 26, 2011

End Date

June 29, 2011

ISSN

2153-5965

Conference Session

Information Systems and Computing Potpourri

Tagged Division

Computing & Information Technology

Page Count

9

Page Numbers

22.116.1 - 22.116.9

Permanent URL

https://peer.asee.org/17398

Download Count

21

Request a correction

Paper Authors

biography

Mohammad Rafiq Muqri DeVry University, Pomona

visit author page

Dr. Mohammad R. Muqri is a Professor in the Department of Computer and Biomedical engineering technology at DeVry University. He received his M.S.E.E. degree from University of Tennessee, Knoxville. His research interests include simulations, algorithmic computing and digital signal processing.

visit author page

author page

Javad Shakib DeVry University, Pomona

Download Paper |

Abstract

A Taste of Java - Discrete and Fast Fourier Transforms This paper presents the development and application of a practical teachingmodule introducing java programming techniques to electronics, computer andbioengineering students before they encounter digital signal processing and itsapplications in junior and/or senior level courses.The Fourier transform takes a signal in the time domain and switches it into thefrequency domain, and vice versa. Fourier Transforms are extensively used inengineering and science in a wide variety of fields including acoustics, digitalsignal processing, image processing, geophysical processing, wavelet theory,optics and astronomy. The Discrete Fourier Transform (DFT) is an essentialdigital signal processing tool, and is highly desirable if the integral form of theFourier Transform cannot be expressed as a mathematical equation. The key tospectral analysis is to choose a window length that suits the signal to be analyzed,since the length of window used for DFT calculations has a strong impact on theinformation the DFT can provide. The operation count of the DFT algorithm istime intensive, and as such a number of Fast Fourier Transform methods havebeen developed to perform DFT efficiently.This paper will explain how this learning and teaching module is instrumental inprogressive learning for students by presenting Java programming and the generaltheory of the Fourier Transform in order to demonstrate how the DFT and FFTalgorithms are derived and computed through leverage of the java data structures.This paper thereby serves as an innovative way to expose technology students tothis difficult topic and gives them a fresh taste of java programming while havingfun learning the Discrete and Fast Fourier Transforms.

Muqri, M. R., & Shakib, J. (2011, June), A Taste of Java: Discrete and Fast Fourier Transforms Paper presented at 2011 ASEE Annual Conference & Exposition, Vancouver, BC. https://peer.asee.org/17398

ASEE holds the copyright on this document. It may be read by the public free of charge. Authors may archive their work on personal websites or in institutional repositories with the following citation: © 2011 American Society for Engineering Education. Other scholars may excerpt or quote from these materials with the same citation. When excerpting or quoting from Conference Proceedings, authors should, in addition to noting the ASEE copyright, list all the original authors and their institutions and name the host city of the conference. - Last updated April 1, 2015