ScholarLens Back to search
1998•Birkhäuser Boston eBooksRequires access

The Discrete Fourier Transform and the Fast Fourier Transform

T.M. Peters, J. H. Bates

Open publisher page 13 citations

Abstract

The preceding chapters have made extensive mention of the Fourier transform (FT), the discrete Fourier transform (DFT), and the fast Fourier transform (FFT). This chapter examines the relationship between the FT and the DFT, discusses the FFT algorithm as a means of computing the DFT much more rapidly than can be achieved with the DFT algorithm directly, and presents some practical guidelines for using the FFT. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

About this research paper

What this paper is about

The preceding chapters have made extensive mention of the Fourier transform (FT), the discrete Fourier transform (DFT), and the fast Fourier transform (FFT). This chapter examines the relationship between the FT and the DFT, discusses the FFT algorithm as a means of computing the DFT much more rapidly than can be achieved with the DFT algorithm directly, and presents some practical guidelines for using the FFT. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Why it matters

OpenAlex reports 13 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The preceding chapters have made extensive mention of the Fourier transform (FT), the discrete Fourier transform (DFT), and the fast Fourier transform (FFT). This chapter examines the relationship between the FT and the DFT, discusses the FFT algorithm as a means of computing the DFT much more rapidly than can be achieved with the DFT algorithm directly, and presents some practical guidelines for using the FFT. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Key concepts: Discrete Fourier transform (general), Split-radix FFT algorithm, Prime-factor FFT algorithm, Fast Fourier transform, Cyclotomic fast Fourier transform, Non-uniform discrete Fourier transform, Rader's FFT algorithm, Discrete-time Fourier transform

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The Discrete Fourier Transform and the Fast Fourier Transform — Research Paper | ScholarLens