#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1984

2016

- This year (0)
- Last 5 years (1)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Henrik V. Sorensen, Douglas L. Jones, Michael T. Heideman, C. Sidney Burrus
- IEEE Trans. Acoustics, Speech, and Signal…
- 1987

This tutorial paper describes the methods for constructing fast algorithms for the computation of the discrete Fourier transform (DFT) of a real-valued series. The application of these ideas to all the major fast Fourier transform (FFT) algorithms is discussed, and the various algorithms are compared. We present a new implementation of the real-valued… (More)

- Henrik V. Sorensen, Douglas L. Jones, C. Sidney Burrus, Michael T. Heideman
- IEEE Trans. Acoustics, Speech, and Signal…
- 1985

THE fast Fourier transform (Fm has become well known . as a very efficient algorithm for calculating the discrete Fourier Transform (Om of a sequence of N numbers. The OFT is used in many disciplines to obtain the spectrum or . frequency content of a Signal, and to facilitate the computation of discrete convolution and correlation. Indeed, published work on… (More)

- Michael T. Heideman
- IEEE Trans. Signal Processing
- 1992

- Henrik V. Sorensen, Michael T. Heideman, C. Sidney Burrus
- IEEE Trans. Acoustics, Speech, and Signal…
- 1986

- Michael T. Heideman, C. Sidney Burrus, Howard W. Johnson
- ICASSP
- 1984

- Michael T. Heideman, C. Sidney Burrus
- IEEE Trans. Acoustics, Speech, and Signal…
- 1986

- Henrik V. Sorensen, Douglas L. Jones, Michael T. Heideman, C. Sidney Burrus
- IEEE Trans. Acoustics, Speech, and Signal…
- 1987

- Yuke Wang, Yiyan Tang, +10 authors H. W. Johnson
- 2016

FFT algorithms is one of the many methods used for the calculation of DFT, but they are preferred due to their increased speed and higher efficiency, which arises due to the fact that for the calculation of a N-point DFT, the sequence is broken into several segments and the DFT for each segment is calculated. However, for this many redundant memory spaces… (More)

- ‹
- 1
- ›