This page is optimized for mobile devices, if you would prefer the desktop version just click here

4.4 Java1485-spectrum analysis using java, forward and inverse

Baldwin illustrates and explains forward and inverse Fourier transforms using both DFT and FFT algorithms. He also illustrates and explains the implementation of frequency filtering by modifying the complex spectrum in the frequency domain and transforming the modified complex spectrum back into the time domain.

Revised: Sat Oct 17 17:00:21 CDT 2015

This page is included in the following book: Digital Signal Processing - DSP

Table of contents

Preface

A previous module titled Fun with Java, How and Why Spectral Analysis Works explained some of the fundamentals regarding spectral analysis.

The module titled Spectrum Analysis using Java, Sampling Frequency, Folding Frequency, and the FFT Algorithm presented and explained several Java programs for doing spectral analysis, including both DFT programs and FFT programs. That module illustratedthe fundamental aspects of spectral analysis that center around the sampling frequency and the Nyquist folding frequency.

The module titled Spectrum Analysis using Java, Frequency Resolution versus Data Length used similar Java programs to explain spectral frequency resolution.

The module titled Spectrum Analysis using Java, Complex Spectrum and Phase Angle explained issues involving the complex spectrum, the phase angle, and shifts in the timedomain.

This module will illustrate and explain forward and inverse Fourier transforms using both DFT and FFT algorithms. I will also illustrate andexplain the implementation of frequency filtering by modifying the complex spectrum in the frequency domain and then transforming the modified complexspectra back into the time domain.

Viewing tip

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.

Figures

  • Figure 1. Forward and inverse transform of a time series using DFT algorithm.
  • Figure 2. Forward and inverse transform of a time series using FFT algorithm.
  • Figure 3. The signature of the complexToComplex method.
  • Figure 4. Filtering in the frequency domain.
  • Figure 5. Filtering in the frequency domain.
<< Chapter < Page Page > Chapter >>

Read also:

OpenStax, Digital signal processing - dsp. OpenStax CNX. Jan 06, 2016 Download for free at https://legacy.cnx.org/content/col11642/1.38
Google Play and the Google Play logo are trademarks of Google Inc.
Jobilize.com uses cookies to ensure that you get the best experience. By continuing to use Jobilize.com web-site, you agree to the Terms of Use and Privacy Policy.