The discrete fourier transform, Part 2: Radix 2 FFT

Citation data:

Journal of Object Technology, ISSN: 1660-1769, Vol: 8, Issue: 5, Page: 21-33

Publication Year:
2009
Usage 137
Downloads 103
Abstract Views 34
Captures 1
Readers 1
Repository URL:
http://digitalcommons.fairfield.edu/engineering-facultypubs/75; https://works.bepress.com/douglas_lyon/12
DOI:
10.5381/jot.2009.8.5.c2
Author(s):
Lyon, Douglas A.
Publisher(s):
AITO - Association Internationale pour les Technologies Objets
Tags:
Computer Science; Computer Engineering; Engineering
article description
This paper is part 2 in a series of papers about the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT). The focus of this paper is on a fast implementation of the DFT, called the FFT (Fast Fourier Transform) and the IFFT (Inverse Fast Fourier Transform). The implementation is based on a wellknown algorithm, called the Radix 2 FFT, and requires that its' input data be an integral power of two in length. Part 3 of this series of papers, demonstrates the computation of the PSD (Power Spectral Density) and applications of the DFT and IDFT. The applications include filtering, windowing, pitch shifting and the spectral analysis of re-sampling.