<< Chapter < Page | Chapter >> Page > |
Revised: Fri Oct 16 23:17:43 CDT 2015
This page is included in the following books:
The how and the why of spectral analysis
A previous module titled Fun with Java, How and Why Spectral Analysis Works explained how and whyspectral analysis works. An understanding of that module is a prerequisite to understanding this module.
Programs to perform spectral analysis
In this module I will provide and explain different programs used for performing spectral analysis. The first program is a very general program thatimplements a Discrete Fourier Transform (DFT) algorithm. I will explain this program in detail.
The second program is a less general, but much faster program that implements a Fast Fourier Transform (FFT) algorithm. I will defer an explanation of this program until a future module. I am providing it here so that you canuse it and compare it with the DFT program in terms of speed and flexibility.
Fundamental aspects of spectral analysis
I will use the DFT program to illustrate several fundamental aspects of spectral analysis that center around the sampling frequency and the Nyquistfolding frequency.
Visual illustration of sampling
I will also provide and explain a program that produces a visual illustration of the impact of the sampling frequency and the Nyquist folding frequency.
Plotting programs
Finally, I will provide, but will not explain two different programs used for display purposes. These are newer versions of graphics display programs that Iexplained in the module titled Plotting Engineering and Scientific Data using Java .
I recommend that you open another copy of this module in a separate browser window and use the following links to easily find and view the Figuresand Listings while you are reading about them.
Notification Switch
Would you like to follow the 'Digital signal processing - dsp' conversation and receive update notifications?